2025-09-04T16:33:10,992 Created temporary directory: /tmp/pip-build-tracker-42rsn5ec 2025-09-04T16:33:10,992 Initialized build tracking at /tmp/pip-build-tracker-42rsn5ec 2025-09-04T16:33:10,992 Created build tracker: /tmp/pip-build-tracker-42rsn5ec 2025-09-04T16:33:10,993 Entered build tracker: /tmp/pip-build-tracker-42rsn5ec 2025-09-04T16:33:10,993 Created temporary directory: /tmp/pip-wheel-yhdilmwe 2025-09-04T16:33:10,996 Created temporary directory: /tmp/pip-ephem-wheel-cache-yc778l8z 2025-09-04T16:33:11,049 Looking in indexes: https://pypi.org/simple, https://www.piwheels.org/simple 2025-09-04T16:33:11,051 2 location(s) to search for versions of networkit: 2025-09-04T16:33:11,051 * https://pypi.org/simple/networkit/ 2025-09-04T16:33:11,051 * https://www.piwheels.org/simple/networkit/ 2025-09-04T16:33:11,051 Fetching project page and analyzing links: https://pypi.org/simple/networkit/ 2025-09-04T16:33:11,052 Getting page https://pypi.org/simple/networkit/ 2025-09-04T16:33:11,053 Found index url https://pypi.org/simple/ 2025-09-04T16:33:11,200 Fetched page https://pypi.org/simple/networkit/ as application/vnd.pypi.simple.v1+json 2025-09-04T16:33:11,215 Found link https://files.pythonhosted.org/packages/72/c8/662d6aded468f8507a55ce84f4ffe4ea0827a6af72a9cad3bd0c24236981/networkit-0.1.9.1.tar.gz (from https://pypi.org/simple/networkit/), version: 0.1.9.1 2025-09-04T16:33:11,216 Found link https://files.pythonhosted.org/packages/3c/d2/2c39ab27bf2753c6cb20233163ad823e7ffdb93653ab48a96b4f943f60a7/networkit-3.4.1.tar.gz (from https://pypi.org/simple/networkit/), version: 3.4.1 2025-09-04T16:33:11,216 Found link https://files.pythonhosted.org/packages/b0/39/1f3a00d5a410315e00bc85c5f997a7737a1a1eedf2e9b6ed21d55dc7b320/networkit-3.5.tar.gz (from https://pypi.org/simple/networkit/), version: 3.5 2025-09-04T16:33:11,216 Found link https://files.pythonhosted.org/packages/34/44/05e21b3eb6f426c2740a6dd21a060e4582f524f82c1cc6e95d3c4b792576/networkit-3.6.tar.gz (from https://pypi.org/simple/networkit/), version: 3.6 2025-09-04T16:33:11,216 Found link https://files.pythonhosted.org/packages/e6/9e/f0a862c78a86b3457787669b4b52017a61fbea159c8c326527e1c2588ed3/networkit-4.0.tar.gz (from https://pypi.org/simple/networkit/), version: 4.0 2025-09-04T16:33:11,217 Found link https://files.pythonhosted.org/packages/d1/b4/262dbdbafda59f09650fcc1c6a42c1e788e8c06cfd89c286351b5fda5e80/networkit-4.0.1.tar.gz (from https://pypi.org/simple/networkit/), version: 4.0.1 2025-09-04T16:33:11,217 Found link https://files.pythonhosted.org/packages/9f/a6/ffdad2f1f4ebbed6ec2e8af8c186ca8bb31d8f25a6a1616d42ba154a6d7e/networkit-4.1.tar.gz (from https://pypi.org/simple/networkit/), version: 4.1 2025-09-04T16:33:11,217 Found link https://files.pythonhosted.org/packages/6e/b7/534dbe69f3e9980a5f5271aff73a0b4dbf4307fac2d7f9115c3aae58ad4a/networkit-4.1.1.tar.gz (from https://pypi.org/simple/networkit/), version: 4.1.1 2025-09-04T16:33:11,217 Found link https://files.pythonhosted.org/packages/e7/72/e7fab49ee35f0ff138cd9810492c0f15fa8d9e3cdaa9f6094f0b5a3d487a/networkit-4.2.tar.gz (from https://pypi.org/simple/networkit/), version: 4.2 2025-09-04T16:33:11,218 Found link https://files.pythonhosted.org/packages/0a/ff/01f3337b6c842b55ac2a6f0023321fa4f23d26a17540b3e5efe0e9d86c4f/networkit-4.3.tar.gz (from https://pypi.org/simple/networkit/), version: 4.3 2025-09-04T16:33:11,218 Found link https://files.pythonhosted.org/packages/94/e4/511277686b0d18ff7b704733b7173f1668b74aceac0e452227fce18bf5d6/networkit-4.4.tar.gz (from https://pypi.org/simple/networkit/), version: 4.4 2025-09-04T16:33:11,218 Found link https://files.pythonhosted.org/packages/95/43/e3c62d12375dd1517a5e2b2ab954e6799aa5ad198b7f45f8ca4c3c278ebc/networkit-4.5.tar.gz (from https://pypi.org/simple/networkit/), version: 4.5 2025-09-04T16:33:11,218 Found link https://files.pythonhosted.org/packages/3c/0d/767c959cc199013e36634128fae5e77815e19d70d10743c94bf97eae3506/networkit-4.6.tar.gz (from https://pypi.org/simple/networkit/), version: 4.6 2025-09-04T16:33:11,218 Found link https://files.pythonhosted.org/packages/d4/36/39298b5c1ddccd062505e7e2f9dcb14235ddd158008bda62cdbb907de8e3/networkit-5.0.tar.gz (from https://pypi.org/simple/networkit/), version: 5.0 2025-09-04T16:33:11,219 Found link https://files.pythonhosted.org/packages/60/7e/0a72676159f1b5cd7664bc99742f13ecb38e461de7fef8f75cc86c011b68/networkit-5.0.1.tar.gz (from https://pypi.org/simple/networkit/), version: 5.0.1 2025-09-04T16:33:11,219 Found link https://files.pythonhosted.org/packages/3a/41/6e5f745f1de9cfbf149772ac2b7f3776327d048bd0eb241b60f4d530cd51/networkit-6.0.tar.gz (from https://pypi.org/simple/networkit/), version: 6.0 2025-09-04T16:33:11,219 Found link https://files.pythonhosted.org/packages/5c/00/f7c5c58030a1bbe62066e87b1f7996fe9123f81df0eb5aeef0801915970c/networkit-6.0.1.tar.gz (from https://pypi.org/simple/networkit/), version: 6.0.1 2025-09-04T16:33:11,219 Found link https://files.pythonhosted.org/packages/8c/06/b92061bc842f6855ddcaff561ce4ba2ee25810e12e28a898c87dab2266e6/networkit-6.1.tar.gz (from https://pypi.org/simple/networkit/), version: 6.1 2025-09-04T16:33:11,219 Found link https://files.pythonhosted.org/packages/26/f9/a058af193cd2058c4326519693700eb6a093cc35e47e0a8ef4e122a452fa/networkit-7.0.tar.gz (from https://pypi.org/simple/networkit/), version: 7.0 2025-09-04T16:33:11,220 Found link https://files.pythonhosted.org/packages/29/fc/dcc0888eb006c8c27fec37e872920c794421670a9819f1de47fdd62938f1/networkit-7.1.tar.gz (from https://pypi.org/simple/networkit/), version: 7.1 2025-09-04T16:33:11,220 Found link https://files.pythonhosted.org/packages/63/9c/597bf1194e823733561422cb8b34ab1ba096678ee592e5f046bacd9be7f6/networkit-8.0.tar.gz (from https://pypi.org/simple/networkit/), version: 8.0 2025-09-04T16:33:11,220 Found link https://files.pythonhosted.org/packages/58/7a/4ef04f2b34fc81c5f2a5060b5cb989509f847d8aa6e359899922acffacf8/networkit-8.1.tar.gz (from https://pypi.org/simple/networkit/), version: 8.1 2025-09-04T16:33:11,220 Found link https://files.pythonhosted.org/packages/21/57/ded0f4e20fc99b25138237063ad614de75883ac1d66f2b324fbfdc355738/networkit-9.0.tar.gz (from https://pypi.org/simple/networkit/), version: 9.0 2025-09-04T16:33:11,220 Skipping link: No binaries permitted for networkit: https://files.pythonhosted.org/packages/d3/f4/b6fe7c85dddef2a7715ddce093727bac973793d29d39f68bff2d5c0747c5/networkit-9.1.1-cp310-cp310-macosx_10_9_x86_64.whl (from https://pypi.org/simple/networkit/) 2025-09-04T16:33:11,221 Skipping link: No binaries permitted for networkit: https://files.pythonhosted.org/packages/97/0b/03b94d44ba612860585294308413557b07749b47e744815667515b1110a9/networkit-9.1.1-cp310-cp310-macosx_12_0_arm64.whl (from https://pypi.org/simple/networkit/) 2025-09-04T16:33:11,221 Skipping link: No binaries permitted for networkit: https://files.pythonhosted.org/packages/a1/d0/53debfe8308789e02da98a500188a452a225368079a9556655902c61d0ed/networkit-9.1.1-cp310-cp310-manylinux_2_12_x86_64.manylinux2010_x86_64.whl (from https://pypi.org/simple/networkit/) 2025-09-04T16:33:11,221 Skipping link: No binaries permitted for networkit: https://files.pythonhosted.org/packages/08/7d/26ddeb1c8003c38f4dc1ad96280f381f8f68ec39f3eef3ea8216fdb007e8/networkit-9.1.1-cp310-cp310-manylinux_2_17_aarch64.manylinux2014_aarch64.whl (from https://pypi.org/simple/networkit/) 2025-09-04T16:33:11,221 Skipping link: No binaries permitted for networkit: https://files.pythonhosted.org/packages/76/f6/d842bdfdb43fb3ff683adb1f121c6e13cbed9af3adc138351eb4a179b5bb/networkit-9.1.1-cp310-cp310-win_amd64.whl (from https://pypi.org/simple/networkit/) 2025-09-04T16:33:11,221 Skipping link: No binaries permitted for networkit: https://files.pythonhosted.org/packages/6c/9e/ae4b8f055bebedcb6a8075ce92551904791a7d93f0fe22dd7a3f112d806e/networkit-9.1.1-cp38-cp38-macosx_10_9_x86_64.whl (from https://pypi.org/simple/networkit/) 2025-09-04T16:33:11,221 Skipping link: No binaries permitted for networkit: https://files.pythonhosted.org/packages/c3/9d/93ee81359adb5c19b828a1f9cdbc51ec079bd791c1ccc80c133524c86e5f/networkit-9.1.1-cp38-cp38-manylinux_2_12_x86_64.manylinux2010_x86_64.whl (from https://pypi.org/simple/networkit/) 2025-09-04T16:33:11,221 Skipping link: No binaries permitted for networkit: https://files.pythonhosted.org/packages/97/30/f4bb52c2f09fd3eea4f885908061edc40c01695d7b060c7459c00c71fbb2/networkit-9.1.1-cp38-cp38-win_amd64.whl (from https://pypi.org/simple/networkit/) 2025-09-04T16:33:11,222 Skipping link: No binaries permitted for networkit: https://files.pythonhosted.org/packages/07/a0/aedb49062daa5ededc5f7ff7311ddd3861d57f0da69be526e2fff80edcbd/networkit-9.1.1-cp39-cp39-macosx_10_9_x86_64.whl (from https://pypi.org/simple/networkit/) 2025-09-04T16:33:11,222 Skipping link: No binaries permitted for networkit: https://files.pythonhosted.org/packages/59/9c/7c072e22303f86851d9c081d004896e717cd913b5caffb46272af08f80c9/networkit-9.1.1-cp39-cp39-macosx_12_0_arm64.whl (from https://pypi.org/simple/networkit/) 2025-09-04T16:33:11,222 Skipping link: No binaries permitted for networkit: https://files.pythonhosted.org/packages/a8/50/aceb2cc86047ffbd30f5c9d9da6172b911f4e22600dfdcf9d2f85a84de24/networkit-9.1.1-cp39-cp39-manylinux_2_12_x86_64.manylinux2010_x86_64.whl (from https://pypi.org/simple/networkit/) 2025-09-04T16:33:11,222 Skipping link: No binaries permitted for networkit: https://files.pythonhosted.org/packages/c5/d2/fe4fee05b85425d9a8086bed50d55527e6dcf15781f6973c69bdfdb27e96/networkit-9.1.1-cp39-cp39-win_amd64.whl (from https://pypi.org/simple/networkit/) 2025-09-04T16:33:11,222 Found link https://files.pythonhosted.org/packages/f4/09/04405f6bb926b5a9c9fd0bf9055b43484a828aa356c5cf3ffe4cca40a631/networkit-9.1.1.tar.gz (from https://pypi.org/simple/networkit/), version: 9.1.1 2025-09-04T16:33:11,222 Found link https://files.pythonhosted.org/packages/b1/ef/78fc285d756e869977e6597f7eb4d4e2e8e5ca036ecb7768e463dcc685f5/networkit-9.1.2.tar.gz (from https://pypi.org/simple/networkit/), version: 9.1.2 2025-09-04T16:33:11,223 Skipping link: No binaries permitted for networkit: https://files.pythonhosted.org/packages/83/58/3bd1b55a3de687b4855c54e7819b275a2192505f2ff5afe65385324a0548/networkit-10.0-cp310-cp310-macosx_10_9_x86_64.whl (from https://pypi.org/simple/networkit/) 2025-09-04T16:33:11,223 Skipping link: No binaries permitted for networkit: https://files.pythonhosted.org/packages/ee/e4/b9a720cc5c30fbc95a11da6a2f510169c7691700e62808bc50eebdefa2cf/networkit-10.0-cp310-cp310-macosx_12_0_arm64.whl (from https://pypi.org/simple/networkit/) 2025-09-04T16:33:11,223 Skipping link: No binaries permitted for networkit: https://files.pythonhosted.org/packages/3c/3f/e606f467419b9ed345d61f2423751a7aed1a365977be2edc3fc52cad58ce/networkit-10.0-cp310-cp310-manylinux_2_12_x86_64.manylinux2010_x86_64.whl (from https://pypi.org/simple/networkit/) 2025-09-04T16:33:11,223 Skipping link: No binaries permitted for networkit: https://files.pythonhosted.org/packages/78/3d/2a5cb58c5baf7af19f0a4fc6e6735cb32172a1b1f3c60728628e9f140edf/networkit-10.0-cp310-cp310-manylinux_2_17_aarch64.manylinux2014_aarch64.whl (from https://pypi.org/simple/networkit/) 2025-09-04T16:33:11,223 Skipping link: No binaries permitted for networkit: https://files.pythonhosted.org/packages/18/7d/4f500a5ae9e37b864142df053ba63c098d46e2534f937e75f9f7717954af/networkit-10.0-cp310-cp310-win_amd64.whl (from https://pypi.org/simple/networkit/) 2025-09-04T16:33:11,223 Skipping link: No binaries permitted for networkit: https://files.pythonhosted.org/packages/70/b1/bba8910969fe4b5e2d39015216c2bce822c56b27d48c73ef732798d6cb6b/networkit-10.0-cp37-cp37m-macosx_10_9_x86_64.whl (from https://pypi.org/simple/networkit/) 2025-09-04T16:33:11,223 Skipping link: No binaries permitted for networkit: https://files.pythonhosted.org/packages/b9/29/d07828c032c5cba14d7f28da8910f423218f77c0d9c3984700ecb318ac9d/networkit-10.0-cp37-cp37m-manylinux_2_12_x86_64.manylinux2010_x86_64.whl (from https://pypi.org/simple/networkit/) 2025-09-04T16:33:11,224 Skipping link: No binaries permitted for networkit: https://files.pythonhosted.org/packages/eb/d7/dc4d6763f48b4a31062b13b1e79de8625e74ade20004b58856d865ba4215/networkit-10.0-cp38-cp38-macosx_10_9_x86_64.whl (from https://pypi.org/simple/networkit/) 2025-09-04T16:33:11,224 Skipping link: No binaries permitted for networkit: https://files.pythonhosted.org/packages/3f/d4/ee9334cc1edcc21b7bd7ec75b0fa869ba2bc2f31d761c827ee08ec71912e/networkit-10.0-cp38-cp38-manylinux_2_12_x86_64.manylinux2010_x86_64.whl (from https://pypi.org/simple/networkit/) 2025-09-04T16:33:11,224 Skipping link: No binaries permitted for networkit: https://files.pythonhosted.org/packages/84/2a/4a15c762e664e40137ffd266b195e611a32335b1424a4f0274cfde9ad063/networkit-10.0-cp38-cp38-win_amd64.whl (from https://pypi.org/simple/networkit/) 2025-09-04T16:33:11,224 Skipping link: No binaries permitted for networkit: https://files.pythonhosted.org/packages/d9/30/7c6528d869872d3984b03da2a5dd5a524747dcd5a10b5e02dffacf99fcd5/networkit-10.0-cp39-cp39-macosx_10_9_x86_64.whl (from https://pypi.org/simple/networkit/) 2025-09-04T16:33:11,224 Skipping link: No binaries permitted for networkit: https://files.pythonhosted.org/packages/4b/80/8ae1ce4f3bcb18ea7ba0b102df368f1b0e86ccb71b38435b6df965c5792d/networkit-10.0-cp39-cp39-macosx_12_0_arm64.whl (from https://pypi.org/simple/networkit/) 2025-09-04T16:33:11,224 Skipping link: No binaries permitted for networkit: https://files.pythonhosted.org/packages/33/4a/00ccafb034d94b27e728dd75e76f8578ba47d520d1defeeed8776f3e0589/networkit-10.0-cp39-cp39-manylinux_2_12_x86_64.manylinux2010_x86_64.whl (from https://pypi.org/simple/networkit/) 2025-09-04T16:33:11,224 Skipping link: No binaries permitted for networkit: https://files.pythonhosted.org/packages/d4/96/a640e2be25a1fea63ba4f26571f0b24b4a3df6b1a83443d12abbbf390d59/networkit-10.0-cp39-cp39-win_amd64.whl (from https://pypi.org/simple/networkit/) 2025-09-04T16:33:11,225 Found link https://files.pythonhosted.org/packages/06/b7/1aad46f0c2e46c1d3f47f7a0d7e486a9b3bd5bf96bfe895fe7767426686a/networkit-10.0.tar.gz (from https://pypi.org/simple/networkit/), version: 10.0 2025-09-04T16:33:11,225 Found link https://files.pythonhosted.org/packages/d1/29/e3bb6ab2fd498a6de8e8112e2b43042bd613f44c7710ae6c57715969ef15/networkit-10.0.1.tar.gz (from https://pypi.org/simple/networkit/), version: 10.0.1 2025-09-04T16:33:11,225 Skipping link: No binaries permitted for networkit: https://files.pythonhosted.org/packages/ef/55/a417dd817650e3f5ca1a2b8e8b1df58f58beb30b33d45d6709a473c6549e/networkit-10.1-cp310-cp310-macosx_10_9_x86_64.whl (from https://pypi.org/simple/networkit/) 2025-09-04T16:33:11,225 Skipping link: No binaries permitted for networkit: https://files.pythonhosted.org/packages/d3/ed/40c607de99bc4938ff6a9ba8326ceba31dcb7785827cb6c6f4f0d7839095/networkit-10.1-cp310-cp310-macosx_13_0_arm64.whl (from https://pypi.org/simple/networkit/) 2025-09-04T16:33:11,225 Skipping link: No binaries permitted for networkit: https://files.pythonhosted.org/packages/9a/63/193617e00caff3edfb50b397ef40c563daa866e74eae2bb9a405087f461c/networkit-10.1-cp310-cp310-manylinux_2_12_x86_64.manylinux2010_x86_64.whl (from https://pypi.org/simple/networkit/) 2025-09-04T16:33:11,225 Skipping link: No binaries permitted for networkit: https://files.pythonhosted.org/packages/05/8b/acee6eff3c9ff6a6af15b5b989c1d894ad35d3807b2d3779c6ce95a560bf/networkit-10.1-cp310-cp310-manylinux_2_17_aarch64.manylinux2014_aarch64.whl (from https://pypi.org/simple/networkit/) 2025-09-04T16:33:11,226 Skipping link: No binaries permitted for networkit: https://files.pythonhosted.org/packages/0b/46/ba8e30282ca972b5e8ce1dbb6e5313bec797a160ffbc1e57f78918d71698/networkit-10.1-cp310-cp310-win_amd64.whl (from https://pypi.org/simple/networkit/) 2025-09-04T16:33:11,226 Skipping link: No binaries permitted for networkit: https://files.pythonhosted.org/packages/a5/28/8ee8a3896faca467a6762af6637918c09a9c8d2f378e3f0c5677b109edb7/networkit-10.1-cp311-cp311-macosx_10_9_x86_64.whl (from https://pypi.org/simple/networkit/) 2025-09-04T16:33:11,226 Skipping link: No binaries permitted for networkit: https://files.pythonhosted.org/packages/c6/96/d11c67910e59386a38032b4be95845573853aeed7da6a8fb39b56862e8cd/networkit-10.1-cp311-cp311-macosx_13_0_arm64.whl (from https://pypi.org/simple/networkit/) 2025-09-04T16:33:11,226 Skipping link: No binaries permitted for networkit: https://files.pythonhosted.org/packages/4f/b2/561c501dc0b74d1327156616e4a22294e357a8a5f5647d26468ea4ab473a/networkit-10.1-cp311-cp311-manylinux_2_17_x86_64.manylinux2014_x86_64.whl (from https://pypi.org/simple/networkit/) 2025-09-04T16:33:11,226 Skipping link: No binaries permitted for networkit: https://files.pythonhosted.org/packages/a0/b5/bcde7e91db4d14cfb8aa48ba839466cd1ab9c8233b7acc12e934bbad972d/networkit-10.1-cp311-cp311-win_amd64.whl (from https://pypi.org/simple/networkit/) 2025-09-04T16:33:11,226 Skipping link: No binaries permitted for networkit: https://files.pythonhosted.org/packages/a8/67/040d1fb0299b7f2885a38e81f0cefb509f4e48c8a9d7f9d10ad1c4b1957e/networkit-10.1-cp38-cp38-macosx_10_9_x86_64.whl (from https://pypi.org/simple/networkit/) 2025-09-04T16:33:11,226 Skipping link: No binaries permitted for networkit: https://files.pythonhosted.org/packages/f8/2b/daa5c6234ccbab519a233db292df00c14ad20d5119819f8299bc955a6ad6/networkit-10.1-cp38-cp38-manylinux_2_12_x86_64.manylinux2010_x86_64.whl (from https://pypi.org/simple/networkit/) 2025-09-04T16:33:11,227 Skipping link: No binaries permitted for networkit: https://files.pythonhosted.org/packages/c8/fd/2fb52cf543be5484a973c4e1756c12776c2c532baafc20a4dadf6c195189/networkit-10.1-cp38-cp38-win_amd64.whl (from https://pypi.org/simple/networkit/) 2025-09-04T16:33:11,227 Skipping link: No binaries permitted for networkit: https://files.pythonhosted.org/packages/5d/f7/0d3cd897a12cbbf719b2aa6a0680d2083a6f5a8364264927ca64efa9d6ae/networkit-10.1-cp39-cp39-macosx_10_9_x86_64.whl (from https://pypi.org/simple/networkit/) 2025-09-04T16:33:11,227 Skipping link: No binaries permitted for networkit: https://files.pythonhosted.org/packages/ce/80/3a74542c95b88990835fdb5e470c22556c073f04c59e8555c870fcef176b/networkit-10.1-cp39-cp39-manylinux_2_12_x86_64.manylinux2010_x86_64.whl (from https://pypi.org/simple/networkit/) 2025-09-04T16:33:11,227 Skipping link: No binaries permitted for networkit: https://files.pythonhosted.org/packages/43/4d/a3798e0b9894be60d951dd1904cd88632c26b7669332cf926eb1038a8345/networkit-10.1-cp39-cp39-win_amd64.whl (from https://pypi.org/simple/networkit/) 2025-09-04T16:33:11,227 Found link https://files.pythonhosted.org/packages/b1/1f/1a7bf202ca0ea6adb41846f8cd500a93e0386b44a552a9212ab8459ed902/networkit-10.1.tar.gz (from https://pypi.org/simple/networkit/), version: 10.1 2025-09-04T16:33:11,227 Found link https://files.pythonhosted.org/packages/ef/34/17135eb258118ab91b0d1463cdedff08424f4f3330d4d8bad3e05cfd554d/networkit-10.1.1.tar.gz (from https://pypi.org/simple/networkit/), version: 10.1.1 2025-09-04T16:33:11,228 Skipping link: No binaries permitted for networkit: https://files.pythonhosted.org/packages/d2/2e/89ed9d51aec2f2ba94a36a4a519b53afb20f62fea89f56becad086deb02d/networkit-11.0-cp310-cp310-macosx_10_9_x86_64.whl (from https://pypi.org/simple/networkit/) (requires-python:>=3.7) 2025-09-04T16:33:11,228 Skipping link: No binaries permitted for networkit: https://files.pythonhosted.org/packages/88/b4/a93b49d52e25091fe3d075430d326c75c6cdf357d54579f32b16bf94ad9e/networkit-11.0-cp310-cp310-macosx_14_0_arm64.whl (from https://pypi.org/simple/networkit/) (requires-python:>=3.7) 2025-09-04T16:33:11,228 Skipping link: No binaries permitted for networkit: https://files.pythonhosted.org/packages/b3/c8/462a9c48825ef70a0b08aa08f4d450a1c2d9e48e4bebdabc8a9121bd5a16/networkit-11.0-cp310-cp310-manylinux_2_17_x86_64.manylinux2014_x86_64.whl (from https://pypi.org/simple/networkit/) (requires-python:>=3.7) 2025-09-04T16:33:11,228 Skipping link: No binaries permitted for networkit: https://files.pythonhosted.org/packages/45/f6/df74cab1b0062f3d92443be5250ce5de3a7291fe67c5a8d41f361373b3e2/networkit-11.0-cp310-cp310-win_amd64.whl (from https://pypi.org/simple/networkit/) (requires-python:>=3.7) 2025-09-04T16:33:11,228 Skipping link: No binaries permitted for networkit: https://files.pythonhosted.org/packages/fb/45/ced2a55925439c1c5e4396bff730800bebbd38f10794d3d9f60e6c8f2b70/networkit-11.0-cp311-cp311-macosx_10_9_x86_64.whl (from https://pypi.org/simple/networkit/) (requires-python:>=3.7) 2025-09-04T16:33:11,228 Skipping link: No binaries permitted for networkit: https://files.pythonhosted.org/packages/61/4c/040c75112956e5fb506794fd9dd0b9880eaf6d7a699e0934cff8ac15114f/networkit-11.0-cp311-cp311-macosx_14_0_arm64.whl (from https://pypi.org/simple/networkit/) (requires-python:>=3.7) 2025-09-04T16:33:11,228 Skipping link: No binaries permitted for networkit: https://files.pythonhosted.org/packages/6e/f7/c911f2aa4c31a3a9acb104691b4ebcd9f06857e4bc2b8330100af886deeb/networkit-11.0-cp311-cp311-manylinux_2_17_aarch64.manylinux2014_aarch64.whl (from https://pypi.org/simple/networkit/) (requires-python:>=3.7) 2025-09-04T16:33:11,229 Skipping link: No binaries permitted for networkit: https://files.pythonhosted.org/packages/8b/7d/7da07b8b898b25a83bd91064ffceaa9fa0d7cb3d20c374c14fa431fb257d/networkit-11.0-cp311-cp311-manylinux_2_17_x86_64.manylinux2014_x86_64.whl (from https://pypi.org/simple/networkit/) (requires-python:>=3.7) 2025-09-04T16:33:11,229 Skipping link: No binaries permitted for networkit: https://files.pythonhosted.org/packages/27/c8/c7654ab9f9dcacae369610662fdf3660e4ab71e328bf62d14eeba0f51bc6/networkit-11.0-cp311-cp311-win_amd64.whl (from https://pypi.org/simple/networkit/) (requires-python:>=3.7) 2025-09-04T16:33:11,229 Skipping link: No binaries permitted for networkit: https://files.pythonhosted.org/packages/dc/5d/f35f018876411de7967dba99166f2da81e7399ae2354a5ea75ae61fdf2bb/networkit-11.0-cp312-cp312-macosx_10_9_x86_64.whl (from https://pypi.org/simple/networkit/) (requires-python:>=3.7) 2025-09-04T16:33:11,229 Skipping link: No binaries permitted for networkit: https://files.pythonhosted.org/packages/1a/4d/baab94b2866176dc0a50bd4f398d50ff41a24fc6fa24939c0bf7504d97db/networkit-11.0-cp312-cp312-macosx_14_0_arm64.whl (from https://pypi.org/simple/networkit/) (requires-python:>=3.7) 2025-09-04T16:33:11,229 Skipping link: No binaries permitted for networkit: https://files.pythonhosted.org/packages/89/c6/8d4e5cf64ffe64fdc1743796ad64610820b6a6384fc61d4676021e289227/networkit-11.0-cp312-cp312-manylinux_2_17_aarch64.manylinux2014_aarch64.whl (from https://pypi.org/simple/networkit/) (requires-python:>=3.7) 2025-09-04T16:33:11,229 Skipping link: No binaries permitted for networkit: https://files.pythonhosted.org/packages/52/a1/0f88b76584c9ac641830c3507a870ff971db120b81fe2935875dc02ef998/networkit-11.0-cp312-cp312-manylinux_2_17_x86_64.manylinux2014_x86_64.whl (from https://pypi.org/simple/networkit/) (requires-python:>=3.7) 2025-09-04T16:33:11,229 Skipping link: No binaries permitted for networkit: https://files.pythonhosted.org/packages/b7/ad/2f2cd46f7adf99b2d3a0e2396c5f6dcdb3c613bd4527066e01895e30164f/networkit-11.0-cp312-cp312-win_amd64.whl (from https://pypi.org/simple/networkit/) (requires-python:>=3.7) 2025-09-04T16:33:11,229 Skipping link: No binaries permitted for networkit: https://files.pythonhosted.org/packages/34/1a/265f41703b8a9bdd81edc2b8f999fb27e0a14e559cd1f1bc57bfce0525de/networkit-11.0-cp38-cp38-macosx_10_9_x86_64.whl (from https://pypi.org/simple/networkit/) (requires-python:>=3.7) 2025-09-04T16:33:11,230 Skipping link: No binaries permitted for networkit: https://files.pythonhosted.org/packages/d4/58/77799f651dd9f59f2a64b94407df7dcbedfe785b4d802e33dc5edfc45001/networkit-11.0-cp38-cp38-manylinux_2_17_x86_64.manylinux2014_x86_64.whl (from https://pypi.org/simple/networkit/) (requires-python:>=3.7) 2025-09-04T16:33:11,230 Skipping link: No binaries permitted for networkit: https://files.pythonhosted.org/packages/cd/32/28b703a1a46723bd675dd318fb26b94cd5f9342abbba2f4edbc3987307c3/networkit-11.0-cp38-cp38-win_amd64.whl (from https://pypi.org/simple/networkit/) (requires-python:>=3.7) 2025-09-04T16:33:11,230 Skipping link: No binaries permitted for networkit: https://files.pythonhosted.org/packages/14/04/2729a1844536ef3a5148e129682d5c7d42f1261cf3f592ddde1792a50daa/networkit-11.0-cp39-cp39-manylinux_2_17_x86_64.manylinux2014_x86_64.whl (from https://pypi.org/simple/networkit/) (requires-python:>=3.7) 2025-09-04T16:33:11,230 Skipping link: No binaries permitted for networkit: https://files.pythonhosted.org/packages/82/fe/b4703e1534a0332f102474618ba1a1c6b09b922f88f3597abf2317f24125/networkit-11.0-cp39-cp39-win_amd64.whl (from https://pypi.org/simple/networkit/) (requires-python:>=3.7) 2025-09-04T16:33:11,231 Found link https://files.pythonhosted.org/packages/f6/6a/e691594d52ceeb2e82d73b1601205dabef7f3b2209bd559f6ba88553c180/networkit-11.0.tar.gz (from https://pypi.org/simple/networkit/) (requires-python:>=3.7), version: 11.0 2025-09-04T16:33:11,231 Skipping link: No binaries permitted for networkit: https://files.pythonhosted.org/packages/bf/d4/38d4ec8d0cbe030054fb1be01f623cc8353fe2eec922e5627ef6e776fc8d/networkit-11.0.1-cp310-cp310-macosx_14_0_arm64.whl (from https://pypi.org/simple/networkit/) (requires-python:>=3.7) 2025-09-04T16:33:11,231 Skipping link: No binaries permitted for networkit: https://files.pythonhosted.org/packages/99/ba/64afbf17b868a60ec2dc540a0dccfd2a069a22d0d22976bfc5720ca4b1ef/networkit-11.0.1-cp310-cp310-macosx_14_0_x86_64.whl (from https://pypi.org/simple/networkit/) (requires-python:>=3.7) 2025-09-04T16:33:11,231 Skipping link: No binaries permitted for networkit: https://files.pythonhosted.org/packages/c0/58/3c76d02a34d3d0006423867ca0f1c6912364d1c9da8036369f1d280ada87/networkit-11.0.1-cp310-cp310-manylinux_2_17_x86_64.manylinux2014_x86_64.whl (from https://pypi.org/simple/networkit/) (requires-python:>=3.7) 2025-09-04T16:33:11,231 Skipping link: No binaries permitted for networkit: https://files.pythonhosted.org/packages/69/b9/b9dda252ae4c48b3173e4040b9460f93825e115b594ac95af612e5cd1589/networkit-11.0.1-cp310-cp310-win_amd64.whl (from https://pypi.org/simple/networkit/) (requires-python:>=3.7) 2025-09-04T16:33:11,231 Skipping link: No binaries permitted for networkit: https://files.pythonhosted.org/packages/ff/55/190513213e8cc76103d58f88a4be0b98c4c925527bf1e26daa3ce14a614c/networkit-11.0.1-cp311-cp311-macosx_14_0_arm64.whl (from https://pypi.org/simple/networkit/) (requires-python:>=3.7) 2025-09-04T16:33:11,232 Skipping link: No binaries permitted for networkit: https://files.pythonhosted.org/packages/c0/4e/fc985dd85dead66635ffaaed414a8ee02705bd57f8c21df1e863ff5ac8fb/networkit-11.0.1-cp311-cp311-macosx_14_0_x86_64.whl (from https://pypi.org/simple/networkit/) (requires-python:>=3.7) 2025-09-04T16:33:11,232 Skipping link: No binaries permitted for networkit: https://files.pythonhosted.org/packages/b5/4a/3e1725127fc7aea30c706eb46f2b64574d89177ba8b6258fec8d340374db/networkit-11.0.1-cp311-cp311-manylinux_2_17_x86_64.manylinux2014_x86_64.whl (from https://pypi.org/simple/networkit/) (requires-python:>=3.7) 2025-09-04T16:33:11,232 Skipping link: No binaries permitted for networkit: https://files.pythonhosted.org/packages/b6/40/4719a6b072c11000fa61732e7a4bf5a6706fa2e89796e06e976ee276bdb3/networkit-11.0.1-cp311-cp311-win_amd64.whl (from https://pypi.org/simple/networkit/) (requires-python:>=3.7) 2025-09-04T16:33:11,232 Skipping link: No binaries permitted for networkit: https://files.pythonhosted.org/packages/b3/44/e23eb6e157ea9d69fda57cbb7af2df3863e999836b6dfb1d182c41ec64d3/networkit-11.0.1-cp312-cp312-macosx_14_0_arm64.whl (from https://pypi.org/simple/networkit/) (requires-python:>=3.7) 2025-09-04T16:33:11,232 Skipping link: No binaries permitted for networkit: https://files.pythonhosted.org/packages/ea/85/2201726bcf12dda4f20ac7c890bce39d428aa5bf10ca6299d8bdd937fd3b/networkit-11.0.1-cp312-cp312-macosx_14_0_x86_64.whl (from https://pypi.org/simple/networkit/) (requires-python:>=3.7) 2025-09-04T16:33:11,232 Skipping link: No binaries permitted for networkit: https://files.pythonhosted.org/packages/54/31/0ccb94fd7d60ab65b2a2262a1358464c445b60ce84db1fb24af86002eacb/networkit-11.0.1-cp312-cp312-manylinux_2_17_x86_64.manylinux2014_x86_64.whl (from https://pypi.org/simple/networkit/) (requires-python:>=3.7) 2025-09-04T16:33:11,232 Skipping link: No binaries permitted for networkit: https://files.pythonhosted.org/packages/a8/fb/1d0ff03c4d16511a79a374dd4b24ce14374c596bc3ee5e3038a6f9c2482e/networkit-11.0.1-cp312-cp312-win_amd64.whl (from https://pypi.org/simple/networkit/) (requires-python:>=3.7) 2025-09-04T16:33:11,233 Skipping link: No binaries permitted for networkit: https://files.pythonhosted.org/packages/74/d8/8b9296bda3a8b2fd0c490356fa291c6f9220037fe3b4528de023f711769e/networkit-11.0.1-cp39-cp39-macosx_14_0_arm64.whl (from https://pypi.org/simple/networkit/) (requires-python:>=3.7) 2025-09-04T16:33:11,233 Skipping link: No binaries permitted for networkit: https://files.pythonhosted.org/packages/60/f7/5f7077d326bd8f18c55c53e08897d73eb43e9a75ee3f3075bb8939c58018/networkit-11.0.1-cp39-cp39-macosx_14_0_x86_64.whl (from https://pypi.org/simple/networkit/) (requires-python:>=3.7) 2025-09-04T16:33:11,233 Skipping link: No binaries permitted for networkit: https://files.pythonhosted.org/packages/54/a0/27d3200beffa569133ff1516650adff3f29a8d10e4853930f51931b80d2f/networkit-11.0.1-cp39-cp39-manylinux_2_17_x86_64.manylinux2014_x86_64.whl (from https://pypi.org/simple/networkit/) (requires-python:>=3.7) 2025-09-04T16:33:11,233 Skipping link: No binaries permitted for networkit: https://files.pythonhosted.org/packages/2f/b6/7455839e12821f0752c7df7f07036555afef2a3cd7fcbe8ae798c30eef61/networkit-11.0.1-cp39-cp39-win_amd64.whl (from https://pypi.org/simple/networkit/) (requires-python:>=3.7) 2025-09-04T16:33:11,233 Found link https://files.pythonhosted.org/packages/d0/f6/7931779f7c6181a5158114925cc970ce22df5750b1b3ef61f5d7bbff79c6/networkit-11.0.1.tar.gz (from https://pypi.org/simple/networkit/) (requires-python:>=3.7), version: 11.0.1 2025-09-04T16:33:11,233 Skipping link: No binaries permitted for networkit: https://files.pythonhosted.org/packages/7e/c0/51ff83f254294e64b68483adf47b493522815d108fa2967e8c80d2179711/networkit-11.1-cp310-cp310-macosx_14_0_arm64.whl (from https://pypi.org/simple/networkit/) (requires-python:>=3.9) 2025-09-04T16:33:11,233 Skipping link: No binaries permitted for networkit: https://files.pythonhosted.org/packages/32/c6/e2290f28a22e2d3f80ed4d2df67e5fa37b06a6bb0ccf57bcf04a90b090c9/networkit-11.1-cp310-cp310-macosx_14_0_x86_64.whl (from https://pypi.org/simple/networkit/) (requires-python:>=3.9) 2025-09-04T16:33:11,234 Skipping link: No binaries permitted for networkit: https://files.pythonhosted.org/packages/71/22/57b97d131c0ca35d3465e6f67890a90f0a3192f0b5ea0bd3a7ccdb129352/networkit-11.1-cp310-cp310-manylinux_2_17_x86_64.manylinux2014_x86_64.whl (from https://pypi.org/simple/networkit/) (requires-python:>=3.9) 2025-09-04T16:33:11,234 Skipping link: No binaries permitted for networkit: https://files.pythonhosted.org/packages/18/87/5c54b584884cdf696cab3ba399fca3453dbb70436978a9c8349898a39472/networkit-11.1-cp310-cp310-win_amd64.whl (from https://pypi.org/simple/networkit/) (requires-python:>=3.9) 2025-09-04T16:33:11,234 Skipping link: No binaries permitted for networkit: https://files.pythonhosted.org/packages/64/35/4a6f65510d836527b69e15af20336ab40dbdb423b30caf1217cc6df8a40d/networkit-11.1-cp311-cp311-macosx_14_0_arm64.whl (from https://pypi.org/simple/networkit/) (requires-python:>=3.9) 2025-09-04T16:33:11,234 Skipping link: No binaries permitted for networkit: https://files.pythonhosted.org/packages/ed/17/5b20cfb759d002cf5d1d8797aae26eb6d10e0af1876b3d5f4ca4e6eed8df/networkit-11.1-cp311-cp311-macosx_14_0_x86_64.whl (from https://pypi.org/simple/networkit/) (requires-python:>=3.9) 2025-09-04T16:33:11,234 Skipping link: No binaries permitted for networkit: https://files.pythonhosted.org/packages/36/f6/bbf26681b005cfa2b0ca28ef43bc2f2a117c195053cbc0bbad35b7991014/networkit-11.1-cp311-cp311-manylinux_2_17_x86_64.manylinux2014_x86_64.whl (from https://pypi.org/simple/networkit/) (requires-python:>=3.9) 2025-09-04T16:33:11,234 Skipping link: No binaries permitted for networkit: https://files.pythonhosted.org/packages/6f/38/344f856d3a06f2afdf3341ff5c1420e0c21450cdd764b409055b70cc28a3/networkit-11.1-cp311-cp311-win_amd64.whl (from https://pypi.org/simple/networkit/) (requires-python:>=3.9) 2025-09-04T16:33:11,234 Skipping link: No binaries permitted for networkit: https://files.pythonhosted.org/packages/16/a0/804f6eecbb603730e666eacb32fa051fc70db7f20885860361030fc8c26e/networkit-11.1-cp312-cp312-macosx_14_0_arm64.whl (from https://pypi.org/simple/networkit/) (requires-python:>=3.9) 2025-09-04T16:33:11,235 Skipping link: No binaries permitted for networkit: https://files.pythonhosted.org/packages/97/ff/404e18aa1d7417c898314f8ada654121a91c83b8c3a0bd2da73dd951aae5/networkit-11.1-cp312-cp312-macosx_14_0_x86_64.whl (from https://pypi.org/simple/networkit/) (requires-python:>=3.9) 2025-09-04T16:33:11,235 Skipping link: No binaries permitted for networkit: https://files.pythonhosted.org/packages/d7/f5/8405f0f2d37cac2f9e74ad15ad9dec2304376945beeca1312ee2a07d4550/networkit-11.1-cp312-cp312-manylinux_2_17_x86_64.manylinux2014_x86_64.whl (from https://pypi.org/simple/networkit/) (requires-python:>=3.9) 2025-09-04T16:33:11,235 Skipping link: No binaries permitted for networkit: https://files.pythonhosted.org/packages/21/24/4f71b483ac3b7c0539e0f068b3f9c14d15c28d8f714b9a5e756328775bed/networkit-11.1-cp312-cp312-win_amd64.whl (from https://pypi.org/simple/networkit/) (requires-python:>=3.9) 2025-09-04T16:33:11,235 Skipping link: No binaries permitted for networkit: https://files.pythonhosted.org/packages/9e/10/6c6a82d382cec2b3224cd067da209117ed0026ec295df68b474d8df70014/networkit-11.1-cp313-cp313-macosx_14_0_arm64.whl (from https://pypi.org/simple/networkit/) (requires-python:>=3.9) 2025-09-04T16:33:11,235 Skipping link: No binaries permitted for networkit: https://files.pythonhosted.org/packages/46/9f/f77aa785cf77422ef5a0fa0d08d82e1f9aaf6761502fa8e72ef031dc2c35/networkit-11.1-cp313-cp313-macosx_14_0_x86_64.whl (from https://pypi.org/simple/networkit/) (requires-python:>=3.9) 2025-09-04T16:33:11,235 Skipping link: No binaries permitted for networkit: https://files.pythonhosted.org/packages/59/b1/6f903c1fbb749edbc02637e8fc0584eb2a48f78b351f9a3440141e608516/networkit-11.1-cp313-cp313-manylinux_2_17_x86_64.manylinux2014_x86_64.whl (from https://pypi.org/simple/networkit/) (requires-python:>=3.9) 2025-09-04T16:33:11,235 Skipping link: No binaries permitted for networkit: https://files.pythonhosted.org/packages/27/7d/359935f1557bc2f9f3cf8210af64276521e5b126ec307e5dd0be20ebd6d5/networkit-11.1-cp313-cp313-win_amd64.whl (from https://pypi.org/simple/networkit/) (requires-python:>=3.9) 2025-09-04T16:33:11,236 Found link https://files.pythonhosted.org/packages/4d/c4/5aac4384dc52698d58620a8f06a159f635388fe65c0da38dce534689ece3/networkit-11.1.tar.gz (from https://pypi.org/simple/networkit/) (requires-python:>=3.9), version: 11.1 2025-09-04T16:33:11,236 Skipping link: No binaries permitted for networkit: https://files.pythonhosted.org/packages/7c/c2/8611ec48bb484c57f7638c91ca05ed67d923d1b37b0e0d2bfd1f0c2f3e27/networkit-11.1.post1-cp310-cp310-manylinux2014_aarch64.manylinux_2_17_aarch64.whl (from https://pypi.org/simple/networkit/) (requires-python:>=3.9) 2025-09-04T16:33:11,236 Skipping link: No binaries permitted for networkit: https://files.pythonhosted.org/packages/59/97/c2cdc7951c6f830a70075a3e3b5682eaa57842b6f0c9c21fd0e552122982/networkit-11.1.post1-cp310-cp310-manylinux_2_17_x86_64.manylinux2014_x86_64.whl (from https://pypi.org/simple/networkit/) (requires-python:>=3.9) 2025-09-04T16:33:11,236 Skipping link: No binaries permitted for networkit: https://files.pythonhosted.org/packages/97/b5/0fd6229220a4359667733551614ea2d397b64a5e24fc902048b753a930e9/networkit-11.1.post1-cp311-cp311-manylinux2014_aarch64.manylinux_2_17_aarch64.whl (from https://pypi.org/simple/networkit/) (requires-python:>=3.9) 2025-09-04T16:33:11,237 Skipping link: No binaries permitted for networkit: https://files.pythonhosted.org/packages/e9/81/8724b2766a088f9b6e0bd5130d820e0ec305b2d126fa98aa8e4b4d171b4e/networkit-11.1.post1-cp311-cp311-manylinux_2_17_x86_64.manylinux2014_x86_64.whl (from https://pypi.org/simple/networkit/) (requires-python:>=3.9) 2025-09-04T16:33:11,237 Skipping link: No binaries permitted for networkit: https://files.pythonhosted.org/packages/00/9e/63669f1d87bd780a5b62c40dbf670c9b866818087cefe3510a85714450db/networkit-11.1.post1-cp312-cp312-manylinux2014_aarch64.manylinux_2_17_aarch64.whl (from https://pypi.org/simple/networkit/) (requires-python:>=3.9) 2025-09-04T16:33:11,237 Skipping link: No binaries permitted for networkit: https://files.pythonhosted.org/packages/92/b6/30b6f1c411a01dd3878ab85ba09ee798d61a110eb1094c9d645a50bdbbda/networkit-11.1.post1-cp312-cp312-manylinux_2_17_x86_64.manylinux2014_x86_64.whl (from https://pypi.org/simple/networkit/) (requires-python:>=3.9) 2025-09-04T16:33:11,237 Skipping link: No binaries permitted for networkit: https://files.pythonhosted.org/packages/0c/61/aa532aa2188d66ec8d1cdf65c1ddc2b05447e6d74789b0e46703c76a0aad/networkit-11.1.post1-cp313-cp313-manylinux2014_aarch64.manylinux_2_17_aarch64.whl (from https://pypi.org/simple/networkit/) (requires-python:>=3.9) 2025-09-04T16:33:11,237 Skipping link: No binaries permitted for networkit: https://files.pythonhosted.org/packages/bc/e0/9366add8e566b4b734799d02002f5c77883a4218570d2d197ea46ecdb113/networkit-11.1.post1-cp313-cp313-manylinux_2_17_x86_64.manylinux2014_x86_64.whl (from https://pypi.org/simple/networkit/) (requires-python:>=3.9) 2025-09-04T16:33:11,238 Fetching project page and analyzing links: https://www.piwheels.org/simple/networkit/ 2025-09-04T16:33:11,238 Getting page https://www.piwheels.org/simple/networkit/ 2025-09-04T16:33:11,239 Found index url https://www.piwheels.org/simple/ 2025-09-04T16:33:11,330 Fetched page https://www.piwheels.org/simple/networkit/ as text/html 2025-09-04T16:33:11,336 Skipping link: No binaries permitted for networkit: https://archive1.piwheels.org/simple/networkit/networkit-4.6-cp35-cp35m-linux_armv6l.whl#sha256=51c61e8fabed32e7ac7368126fda6ca6cbb82c2ea3a998bcb8cd29ecd0169230 (from https://www.piwheels.org/simple/networkit/) 2025-09-04T16:33:11,336 Skipping link: No binaries permitted for networkit: https://archive1.piwheels.org/simple/networkit/networkit-4.6-cp35-cp35m-linux_armv7l.whl#sha256=51c61e8fabed32e7ac7368126fda6ca6cbb82c2ea3a998bcb8cd29ecd0169230 (from https://www.piwheels.org/simple/networkit/) 2025-09-04T16:33:11,336 Skipping link: No binaries permitted for networkit: https://archive1.piwheels.org/simple/networkit/networkit-4.5-cp35-cp35m-linux_armv7l.whl#sha256=443c51559e592b4147240b6447933679e93e36fe3c492518e0c29f16ae1a8d02 (from https://www.piwheels.org/simple/networkit/) 2025-09-04T16:33:11,337 Skipping link: No binaries permitted for networkit: https://archive1.piwheels.org/simple/networkit/networkit-4.5-cp35-cp35m-linux_armv6l.whl#sha256=443c51559e592b4147240b6447933679e93e36fe3c492518e0c29f16ae1a8d02 (from https://www.piwheels.org/simple/networkit/) 2025-09-04T16:33:11,337 Skipping link: No binaries permitted for networkit: https://archive1.piwheels.org/simple/networkit/networkit-4.5-cp34-cp34m-linux_armv7l.whl#sha256=e1802ea811d5b3d1c24e64254ab7df636be48396a5d3712b57151853bf13117e (from https://www.piwheels.org/simple/networkit/) 2025-09-04T16:33:11,337 Skipping link: No binaries permitted for networkit: https://archive1.piwheels.org/simple/networkit/networkit-4.5-cp34-cp34m-linux_armv6l.whl#sha256=e1802ea811d5b3d1c24e64254ab7df636be48396a5d3712b57151853bf13117e (from https://www.piwheels.org/simple/networkit/) 2025-09-04T16:33:11,337 Skipping link: No binaries permitted for networkit: https://archive1.piwheels.org/simple/networkit/networkit-4.4-cp34-cp34m-linux_armv7l.whl#sha256=01d2fef172fed5e6186f662ca82d2172e4e32148af9f7d0a7047dacf025c5d71 (from https://www.piwheels.org/simple/networkit/) 2025-09-04T16:33:11,337 Skipping link: No binaries permitted for networkit: https://archive1.piwheels.org/simple/networkit/networkit-4.4-cp35-cp35m-linux_armv7l.whl#sha256=07a3da42b90b6cedbf604bbe503c6b2f27f8508962a97ac156f6a0077425c504 (from https://www.piwheels.org/simple/networkit/) 2025-09-04T16:33:11,337 Skipping link: No binaries permitted for networkit: https://archive1.piwheels.org/simple/networkit/networkit-4.4-cp35-cp35m-linux_armv6l.whl#sha256=07a3da42b90b6cedbf604bbe503c6b2f27f8508962a97ac156f6a0077425c504 (from https://www.piwheels.org/simple/networkit/) 2025-09-04T16:33:11,337 Skipping link: No binaries permitted for networkit: https://archive1.piwheels.org/simple/networkit/networkit-4.3-cp34-cp34m-linux_armv7l.whl#sha256=7f226d8dbac2db925194245ab3228c0fae66aea9bce1a63f31ef4aaef122fa4f (from https://www.piwheels.org/simple/networkit/) 2025-09-04T16:33:11,337 Skipping link: No binaries permitted for networkit: https://archive1.piwheels.org/simple/networkit/networkit-4.3-cp34-cp34m-linux_armv6l.whl#sha256=7f226d8dbac2db925194245ab3228c0fae66aea9bce1a63f31ef4aaef122fa4f (from https://www.piwheels.org/simple/networkit/) 2025-09-04T16:33:11,338 Skipping link: No binaries permitted for networkit: https://archive1.piwheels.org/simple/networkit/networkit-4.3-cp35-cp35m-linux_armv6l.whl#sha256=74d6eb7eacf22c7e338f39b2959bbc902fee7786d23824197ad018a6b2601ab4 (from https://www.piwheels.org/simple/networkit/) 2025-09-04T16:33:11,338 Skipping link: No binaries permitted for networkit: https://archive1.piwheels.org/simple/networkit/networkit-4.3-cp35-cp35m-linux_armv7l.whl#sha256=74d6eb7eacf22c7e338f39b2959bbc902fee7786d23824197ad018a6b2601ab4 (from https://www.piwheels.org/simple/networkit/) 2025-09-04T16:33:11,338 Skipping link: No binaries permitted for networkit: https://archive1.piwheels.org/simple/networkit/networkit-4.0.1-cp34-cp34m-linux_armv7l.whl#sha256=e7cdbc05f62efce62a1f37ef1868ea540e7e8c15b9fb44d70f59e55f576403f4 (from https://www.piwheels.org/simple/networkit/) 2025-09-04T16:33:11,338 Skipping link: No binaries permitted for networkit: https://archive1.piwheels.org/simple/networkit/networkit-4.0.1-cp34-cp34m-linux_armv6l.whl#sha256=e7cdbc05f62efce62a1f37ef1868ea540e7e8c15b9fb44d70f59e55f576403f4 (from https://www.piwheels.org/simple/networkit/) 2025-09-04T16:33:11,338 Skipping link: No binaries permitted for networkit: https://archive1.piwheels.org/simple/networkit/networkit-4.0.1-cp35-cp35m-linux_armv6l.whl#sha256=c5586213583e7a30eed92aed41d6c38a3509e769b00e522b26d551c6b4d02b80 (from https://www.piwheels.org/simple/networkit/) 2025-09-04T16:33:11,338 Skipping link: No binaries permitted for networkit: https://archive1.piwheels.org/simple/networkit/networkit-4.0.1-cp35-cp35m-linux_armv7l.whl#sha256=c5586213583e7a30eed92aed41d6c38a3509e769b00e522b26d551c6b4d02b80 (from https://www.piwheels.org/simple/networkit/) 2025-09-04T16:33:11,338 Skipping link: No binaries permitted for networkit: https://archive1.piwheels.org/simple/networkit/networkit-4.0-cp34-cp34m-linux_armv7l.whl#sha256=ea8f5700e73d53b450ec2878c57adce653f792339844873fcf1c98485d8a66d2 (from https://www.piwheels.org/simple/networkit/) 2025-09-04T16:33:11,338 Skipping link: No binaries permitted for networkit: https://archive1.piwheels.org/simple/networkit/networkit-4.0-cp34-cp34m-linux_armv6l.whl#sha256=ea8f5700e73d53b450ec2878c57adce653f792339844873fcf1c98485d8a66d2 (from https://www.piwheels.org/simple/networkit/) 2025-09-04T16:33:11,339 Skipping link: No binaries permitted for networkit: https://archive1.piwheels.org/simple/networkit/networkit-4.0-cp35-cp35m-linux_armv6l.whl#sha256=a8e13868ef8e0c6b6d094bd9a892be8773b218fd9531f61f4e71474e2d1b3e2e (from https://www.piwheels.org/simple/networkit/) 2025-09-04T16:33:11,339 Skipping link: No binaries permitted for networkit: https://archive1.piwheels.org/simple/networkit/networkit-4.0-cp35-cp35m-linux_armv7l.whl#sha256=a8e13868ef8e0c6b6d094bd9a892be8773b218fd9531f61f4e71474e2d1b3e2e (from https://www.piwheels.org/simple/networkit/) 2025-09-04T16:33:11,339 Skipping link: No binaries permitted for networkit: https://archive1.piwheels.org/simple/networkit/networkit-3.6-cp34-cp34m-linux_armv7l.whl#sha256=e7885e1db64d34fc4bb3978058ec663481f9f20ed13c5a325d5c7d222f6a7111 (from https://www.piwheels.org/simple/networkit/) 2025-09-04T16:33:11,339 Skipping link: No binaries permitted for networkit: https://archive1.piwheels.org/simple/networkit/networkit-3.6-cp34-cp34m-linux_armv6l.whl#sha256=e7885e1db64d34fc4bb3978058ec663481f9f20ed13c5a325d5c7d222f6a7111 (from https://www.piwheels.org/simple/networkit/) 2025-09-04T16:33:11,339 Skipping link: No binaries permitted for networkit: https://archive1.piwheels.org/simple/networkit/networkit-3.6-cp35-cp35m-linux_armv6l.whl#sha256=7763c81b770f4c3a013658dd5b496681cd3c49aae72711c8491b7db8e4489551 (from https://www.piwheels.org/simple/networkit/) 2025-09-04T16:33:11,339 Skipping link: No binaries permitted for networkit: https://archive1.piwheels.org/simple/networkit/networkit-3.6-cp35-cp35m-linux_armv7l.whl#sha256=7763c81b770f4c3a013658dd5b496681cd3c49aae72711c8491b7db8e4489551 (from https://www.piwheels.org/simple/networkit/) 2025-09-04T16:33:11,339 Skipping link: No binaries permitted for networkit: https://archive1.piwheels.org/simple/networkit/networkit-3.5-cp34-cp34m-linux_armv7l.whl#sha256=cf6d5d04c55694d569b55ba7440a6570c7bd14bedcb21ec1c0a8d8a206ccb268 (from https://www.piwheels.org/simple/networkit/) 2025-09-04T16:33:11,339 Skipping link: No binaries permitted for networkit: https://archive1.piwheels.org/simple/networkit/networkit-3.5-cp34-cp34m-linux_armv6l.whl#sha256=cf6d5d04c55694d569b55ba7440a6570c7bd14bedcb21ec1c0a8d8a206ccb268 (from https://www.piwheels.org/simple/networkit/) 2025-09-04T16:33:11,339 Skipping link: No binaries permitted for networkit: https://archive1.piwheels.org/simple/networkit/networkit-3.5-cp35-cp35m-linux_armv7l.whl#sha256=4522e8183785c82c462bada5926781dd91dec50074a9438b61a7c6d628dbee23 (from https://www.piwheels.org/simple/networkit/) 2025-09-04T16:33:11,340 Skipping link: No binaries permitted for networkit: https://archive1.piwheels.org/simple/networkit/networkit-3.5-cp35-cp35m-linux_armv6l.whl#sha256=4522e8183785c82c462bada5926781dd91dec50074a9438b61a7c6d628dbee23 (from https://www.piwheels.org/simple/networkit/) 2025-09-04T16:33:11,340 Skipping link: No binaries permitted for networkit: https://archive1.piwheels.org/simple/networkit/networkit-3.4.1-cp37-cp37m-linux_armv7l.whl#sha256=f26730503997deea6f7e2e53a65a1d0773f90ad2f0704828d578d224f0030f54 (from https://www.piwheels.org/simple/networkit/) 2025-09-04T16:33:11,340 Skipping link: No binaries permitted for networkit: https://archive1.piwheels.org/simple/networkit/networkit-3.4.1-cp37-cp37m-linux_armv6l.whl#sha256=f26730503997deea6f7e2e53a65a1d0773f90ad2f0704828d578d224f0030f54 (from https://www.piwheels.org/simple/networkit/) 2025-09-04T16:33:11,340 Skipping link: No binaries permitted for networkit: https://archive1.piwheels.org/simple/networkit/networkit-3.4.1-cp35-cp35m-linux_armv7l.whl#sha256=107e7a1b2452a624aa917f167aa1c74b3c68adf2e44a41d6a792e8b03b99aac4 (from https://www.piwheels.org/simple/networkit/) 2025-09-04T16:33:11,340 Skipping link: No binaries permitted for networkit: https://archive1.piwheels.org/simple/networkit/networkit-3.4.1-cp35-cp35m-linux_armv6l.whl#sha256=107e7a1b2452a624aa917f167aa1c74b3c68adf2e44a41d6a792e8b03b99aac4 (from https://www.piwheels.org/simple/networkit/) 2025-09-04T16:33:11,340 Skipping link: No binaries permitted for networkit: https://archive1.piwheels.org/simple/networkit/networkit-3.4.1-cp34-cp34m-linux_armv7l.whl#sha256=bd509659fac19ad691a5de10c9a8d1d43adfd4d5b5504344baccce3e947e9995 (from https://www.piwheels.org/simple/networkit/) 2025-09-04T16:33:11,340 Skipping link: No binaries permitted for networkit: https://archive1.piwheels.org/simple/networkit/networkit-3.4.1-cp34-cp34m-linux_armv6l.whl#sha256=bd509659fac19ad691a5de10c9a8d1d43adfd4d5b5504344baccce3e947e9995 (from https://www.piwheels.org/simple/networkit/) 2025-09-04T16:33:11,340 Skipping link: No binaries permitted for networkit: https://archive1.piwheels.org/simple/networkit/networkit-0.1.9.1-cp34-cp34m-linux_armv7l.whl#sha256=013ca93483e56b3c9a32084040dc96dc1032e5e788572331c19bf058b6f3b852 (from https://www.piwheels.org/simple/networkit/) 2025-09-04T16:33:11,340 Skipping link: No binaries permitted for networkit: https://archive1.piwheels.org/simple/networkit/networkit-0.1.9.1-cp34-cp34m-linux_armv6l.whl#sha256=013ca93483e56b3c9a32084040dc96dc1032e5e788572331c19bf058b6f3b852 (from https://www.piwheels.org/simple/networkit/) 2025-09-04T16:33:11,341 Skipping link: not a file: https://www.piwheels.org/simple/networkit/ 2025-09-04T16:33:11,341 Skipping link: not a file: https://pypi.org/simple/networkit/ 2025-09-04T16:33:11,365 Given no hashes to check 1 links for project 'networkit': discarding no candidates 2025-09-04T16:33:11,366 Collecting networkit==3.4.1 2025-09-04T16:33:11,368 Created temporary directory: /tmp/pip-unpack-15h6yte3 2025-09-04T16:33:11,537 Downloading networkit-3.4.1.tar.gz (582 kB) 2025-09-04T16:33:11,886 Added networkit==3.4.1 from https://files.pythonhosted.org/packages/3c/d2/2c39ab27bf2753c6cb20233163ad823e7ffdb93653ab48a96b4f943f60a7/networkit-3.4.1.tar.gz to build tracker '/tmp/pip-build-tracker-42rsn5ec' 2025-09-04T16:33:11,887 Running setup.py (path:/tmp/pip-wheel-yhdilmwe/networkit_93c8151e30bd4b219786e7267f52f2ca/setup.py) egg_info for package networkit 2025-09-04T16:33:11,887 Created temporary directory: /tmp/pip-pip-egg-info-g3p0pr9g 2025-09-04T16:33:11,887 Preparing metadata (setup.py): started 2025-09-04T16:33:11,888 Running command python setup.py egg_info 2025-09-04T16:33:12,407 /tmp/pip-wheel-yhdilmwe/networkit_93c8151e30bd4b219786e7267f52f2ca/setup.py:10: SetuptoolsDeprecationWarning: The test command is disabled and references to it are deprecated. 2025-09-04T16:33:12,407 !! 2025-09-04T16:33:12,407 ******************************************************************************** 2025-09-04T16:33:12,407 Please remove any references to `setuptools.command.test` in all supported versions of the affected package. 2025-09-04T16:33:12,408 This deprecation is overdue, please update your project and remove deprecated 2025-09-04T16:33:12,408 calls to avoid build errors in the future. 2025-09-04T16:33:12,408 ******************************************************************************** 2025-09-04T16:33:12,408 !! 2025-09-04T16:33:12,408 from setuptools.command.test import test as TestCommand 2025-09-04T16:33:12,766 /tmp/pip-wheel-yhdilmwe/networkit_93c8151e30bd4b219786e7267f52f2ca/setup.py:24: DeprecationWarning: distutils Version classes are deprecated. Use packaging.version instead. 2025-09-04T16:33:12,766 if LooseVersion(Cython.__version__) >= LooseVersion('0.21'): 2025-09-04T16:33:14,165 /usr/local/lib/python3.13/dist-packages/setuptools/_distutils/dist.py:289: UserWarning: Unknown distribution option: 'test_suite' 2025-09-04T16:33:14,165 warnings.warn(msg) 2025-09-04T16:33:14,373 /usr/local/lib/python3.13/dist-packages/setuptools/dist.py:759: SetuptoolsDeprecationWarning: License classifiers are deprecated. 2025-09-04T16:33:14,373 !! 2025-09-04T16:33:14,374 ******************************************************************************** 2025-09-04T16:33:14,374 Please consider removing the following classifiers in favor of a SPDX license expression: 2025-09-04T16:33:14,374 License :: OSI Approved :: MIT License 2025-09-04T16:33:14,374 See https://packaging.python.org/en/latest/guides/writing-pyproject-toml/#license for details. 2025-09-04T16:33:14,374 ******************************************************************************** 2025-09-04T16:33:14,374 !! 2025-09-04T16:33:14,374 self._finalize_license_expression() 2025-09-04T16:33:14,448 running egg_info 2025-09-04T16:33:14,527 creating /tmp/pip-pip-egg-info-g3p0pr9g/networkit.egg-info 2025-09-04T16:33:14,527 writing /tmp/pip-pip-egg-info-g3p0pr9g/networkit.egg-info/PKG-INFO 2025-09-04T16:33:14,529 writing dependency_links to /tmp/pip-pip-egg-info-g3p0pr9g/networkit.egg-info/dependency_links.txt 2025-09-04T16:33:14,529 writing top-level names to /tmp/pip-pip-egg-info-g3p0pr9g/networkit.egg-info/top_level.txt 2025-09-04T16:33:14,530 writing manifest file '/tmp/pip-pip-egg-info-g3p0pr9g/networkit.egg-info/SOURCES.txt' 2025-09-04T16:33:14,761 reading manifest file '/tmp/pip-pip-egg-info-g3p0pr9g/networkit.egg-info/SOURCES.txt' 2025-09-04T16:33:14,765 writing manifest file '/tmp/pip-pip-egg-info-g3p0pr9g/networkit.egg-info/SOURCES.txt' 2025-09-04T16:33:14,889 Preparing metadata (setup.py): finished with status 'done' 2025-09-04T16:33:14,894 Source in /tmp/pip-wheel-yhdilmwe/networkit_93c8151e30bd4b219786e7267f52f2ca has version 3.4.1, which satisfies requirement networkit==3.4.1 from https://files.pythonhosted.org/packages/3c/d2/2c39ab27bf2753c6cb20233163ad823e7ffdb93653ab48a96b4f943f60a7/networkit-3.4.1.tar.gz 2025-09-04T16:33:14,894 Removed networkit==3.4.1 from https://files.pythonhosted.org/packages/3c/d2/2c39ab27bf2753c6cb20233163ad823e7ffdb93653ab48a96b4f943f60a7/networkit-3.4.1.tar.gz from build tracker '/tmp/pip-build-tracker-42rsn5ec' 2025-09-04T16:33:14,898 Created temporary directory: /tmp/pip-unpack-9pvx_83l 2025-09-04T16:33:14,898 Created temporary directory: /tmp/pip-unpack-4yd1q2os 2025-09-04T16:33:14,898 Building wheels for collected packages: networkit 2025-09-04T16:33:14,899 Created temporary directory: /tmp/pip-wheel-zbhuj6hy 2025-09-04T16:33:14,900 DEPRECATION: Building 'networkit' using the legacy setup.py bdist_wheel mechanism, which will be removed in a future version. pip 25.3 will enforce this behaviour change. A possible replacement is to use the standardized build interface by setting the `--use-pep517` option, (possibly combined with `--no-build-isolation`), or adding a `pyproject.toml` file to the source tree of 'networkit'. Discussion can be found at https://github.com/pypa/pip/issues/6334 2025-09-04T16:33:14,901 Building wheel for networkit (setup.py): started 2025-09-04T16:33:14,901 Destination directory: /tmp/pip-wheel-zbhuj6hy 2025-09-04T16:33:14,902 Running command python setup.py bdist_wheel 2025-09-04T16:33:15,424 /tmp/pip-wheel-yhdilmwe/networkit_93c8151e30bd4b219786e7267f52f2ca/setup.py:10: SetuptoolsDeprecationWarning: The test command is disabled and references to it are deprecated. 2025-09-04T16:33:15,424 !! 2025-09-04T16:33:15,424 ******************************************************************************** 2025-09-04T16:33:15,424 Please remove any references to `setuptools.command.test` in all supported versions of the affected package. 2025-09-04T16:33:15,424 This deprecation is overdue, please update your project and remove deprecated 2025-09-04T16:33:15,424 calls to avoid build errors in the future. 2025-09-04T16:33:15,425 ******************************************************************************** 2025-09-04T16:33:15,425 !! 2025-09-04T16:33:15,425 from setuptools.command.test import test as TestCommand 2025-09-04T16:33:15,766 /tmp/pip-wheel-yhdilmwe/networkit_93c8151e30bd4b219786e7267f52f2ca/setup.py:24: DeprecationWarning: distutils Version classes are deprecated. Use packaging.version instead. 2025-09-04T16:33:15,766 if LooseVersion(Cython.__version__) >= LooseVersion('0.21'): 2025-09-04T16:33:17,217 /usr/local/lib/python3.13/dist-packages/setuptools/_distutils/dist.py:289: UserWarning: Unknown distribution option: 'test_suite' 2025-09-04T16:33:17,217 warnings.warn(msg) 2025-09-04T16:33:17,431 /usr/local/lib/python3.13/dist-packages/setuptools/dist.py:759: SetuptoolsDeprecationWarning: License classifiers are deprecated. 2025-09-04T16:33:17,431 !! 2025-09-04T16:33:17,431 ******************************************************************************** 2025-09-04T16:33:17,431 Please consider removing the following classifiers in favor of a SPDX license expression: 2025-09-04T16:33:17,431 License :: OSI Approved :: MIT License 2025-09-04T16:33:17,432 See https://packaging.python.org/en/latest/guides/writing-pyproject-toml/#license for details. 2025-09-04T16:33:17,432 ******************************************************************************** 2025-09-04T16:33:17,432 !! 2025-09-04T16:33:17,432 self._finalize_license_expression() 2025-09-04T16:33:17,433 running bdist_wheel 2025-09-04T16:33:17,726 running build 2025-09-04T16:33:17,726 running build_py 2025-09-04T16:33:17,803 creating build/lib.linux-armv7l-cpython-313/networkit 2025-09-04T16:33:17,803 copying networkit/algebraic.py -> build/lib.linux-armv7l-cpython-313/networkit 2025-09-04T16:33:17,804 copying networkit/coloring.py -> build/lib.linux-armv7l-cpython-313/networkit 2025-09-04T16:33:17,805 copying networkit/plot.py -> build/lib.linux-armv7l-cpython-313/networkit 2025-09-04T16:33:17,805 copying networkit/community.py -> build/lib.linux-armv7l-cpython-313/networkit 2025-09-04T16:33:17,806 copying networkit/generators.py -> build/lib.linux-armv7l-cpython-313/networkit 2025-09-04T16:33:17,806 copying networkit/dynamic.py -> build/lib.linux-armv7l-cpython-313/networkit 2025-09-04T16:33:17,807 copying networkit/graphio.py -> build/lib.linux-armv7l-cpython-313/networkit 2025-09-04T16:33:17,807 copying networkit/scd.py -> build/lib.linux-armv7l-cpython-313/networkit 2025-09-04T16:33:17,808 copying networkit/centrality.py -> build/lib.linux-armv7l-cpython-313/networkit 2025-09-04T16:33:17,808 copying networkit/powerlaw.py -> build/lib.linux-armv7l-cpython-313/networkit 2025-09-04T16:33:17,809 copying networkit/partitioning.py -> build/lib.linux-armv7l-cpython-313/networkit 2025-09-04T16:33:17,809 copying networkit/flow.py -> build/lib.linux-armv7l-cpython-313/networkit 2025-09-04T16:33:17,810 copying networkit/graph.py -> build/lib.linux-armv7l-cpython-313/networkit 2025-09-04T16:33:17,810 copying networkit/workflows.py -> build/lib.linux-armv7l-cpython-313/networkit 2025-09-04T16:33:17,811 copying networkit/nxadapter.py -> build/lib.linux-armv7l-cpython-313/networkit 2025-09-04T16:33:17,811 copying networkit/GraphMLIO.py -> build/lib.linux-armv7l-cpython-313/networkit 2025-09-04T16:33:17,812 copying networkit/__init__.py -> build/lib.linux-armv7l-cpython-313/networkit 2025-09-04T16:33:17,812 copying networkit/termgraph.py -> build/lib.linux-armv7l-cpython-313/networkit 2025-09-04T16:33:17,813 copying networkit/engineering.py -> build/lib.linux-armv7l-cpython-313/networkit 2025-09-04T16:33:17,813 copying networkit/properties.py -> build/lib.linux-armv7l-cpython-313/networkit 2025-09-04T16:33:17,814 copying networkit/auxiliary.py -> build/lib.linux-armv7l-cpython-313/networkit 2025-09-04T16:33:17,814 copying networkit/distmeasures.py -> build/lib.linux-armv7l-cpython-313/networkit 2025-09-04T16:33:17,815 copying networkit/structures.py -> build/lib.linux-armv7l-cpython-313/networkit 2025-09-04T16:33:17,815 copying networkit/stopwatch.py -> build/lib.linux-armv7l-cpython-313/networkit 2025-09-04T16:33:17,816 copying networkit/viztasks.py -> build/lib.linux-armv7l-cpython-313/networkit 2025-09-04T16:33:17,817 creating build/lib.linux-armv7l-cpython-313/networkit/gephi 2025-09-04T16:33:17,817 copying networkit/gephi/pyclient.py -> build/lib.linux-armv7l-cpython-313/networkit/gephi 2025-09-04T16:33:17,817 copying networkit/gephi/streaming.py -> build/lib.linux-armv7l-cpython-313/networkit/gephi 2025-09-04T16:33:17,818 copying networkit/gephi/csv.py -> build/lib.linux-armv7l-cpython-313/networkit/gephi 2025-09-04T16:33:17,818 copying networkit/gephi/__init__.py -> build/lib.linux-armv7l-cpython-313/networkit/gephi 2025-09-04T16:33:17,819 creating build/lib.linux-armv7l-cpython-313/networkit/viztools 2025-09-04T16:33:17,820 copying networkit/viztools/nodemap.py -> build/lib.linux-armv7l-cpython-313/networkit/viztools 2025-09-04T16:33:17,820 copying networkit/viztools/edgemap.py -> build/lib.linux-armv7l-cpython-313/networkit/viztools 2025-09-04T16:33:17,821 copying networkit/viztools/graphio.py -> build/lib.linux-armv7l-cpython-313/networkit/viztools 2025-09-04T16:33:17,821 copying networkit/viztools/cluster.py -> build/lib.linux-armv7l-cpython-313/networkit/viztools 2025-09-04T16:33:17,822 copying networkit/viztools/graph.py -> build/lib.linux-armv7l-cpython-313/networkit/viztools 2025-09-04T16:33:17,822 copying networkit/viztools/layout.py -> build/lib.linux-armv7l-cpython-313/networkit/viztools 2025-09-04T16:33:17,823 copying networkit/viztools/__init__.py -> build/lib.linux-armv7l-cpython-313/networkit/viztools 2025-09-04T16:33:17,823 copying networkit/viztools/construct.py -> build/lib.linux-armv7l-cpython-313/networkit/viztools 2025-09-04T16:33:17,824 copying networkit/viztools/drawing.py -> build/lib.linux-armv7l-cpython-313/networkit/viztools 2025-09-04T16:33:17,825 creating build/lib.linux-armv7l-cpython-313/networkit/test 2025-09-04T16:33:17,825 copying networkit/test/test_community.py -> build/lib.linux-armv7l-cpython-313/networkit/test 2025-09-04T16:33:17,825 copying networkit/test/__init__.py -> build/lib.linux-armv7l-cpython-313/networkit/test 2025-09-04T16:33:17,826 creating build/lib.linux-armv7l-cpython-313/networkit/test/gephi 2025-09-04T16:33:17,826 copying networkit/test/gephi/__init__.py -> build/lib.linux-armv7l-cpython-313/networkit/test/gephi 2025-09-04T16:33:17,827 creating build/lib.linux-armv7l-cpython-313/networkit/test/extension 2025-09-04T16:33:17,827 copying networkit/test/extension/test.py -> build/lib.linux-armv7l-cpython-313/networkit/test/extension 2025-09-04T16:33:17,828 copying networkit/test/extension/__init__.py -> build/lib.linux-armv7l-cpython-313/networkit/test/extension 2025-09-04T16:33:17,832 running build_ext 2025-09-04T16:33:17,963 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/Globals.o networkit/cpp/Globals.cpp 2025-09-04T16:33:17,967 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/EdmondsKarp.o networkit/cpp/flow/EdmondsKarp.cpp 2025-09-04T16:33:17,967 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/Noise.o networkit/cpp/auxiliary/Noise.cpp 2025-09-04T16:33:17,969 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/Timer.o networkit/cpp/auxiliary/Timer.cpp 2025-09-04T16:33:19,913 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/NumericTools.o networkit/cpp/auxiliary/NumericTools.cpp 2025-09-04T16:33:20,675 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/Log.o networkit/cpp/auxiliary/Log.cpp 2025-09-04T16:33:20,788 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/Parallelism.o networkit/cpp/auxiliary/Parallelism.cpp 2025-09-04T16:33:20,911 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/Random.o networkit/cpp/auxiliary/Random.cpp 2025-09-04T16:33:22,771 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/SampledGraphStructuralRandMeasure.o networkit/cpp/community/SampledGraphStructuralRandMeasure.cpp 2025-09-04T16:33:24,150 In file included from /usr/include/c++/14/vector:72, 2025-09-04T16:33:24,150 from networkit/cpp/flow/../graph/Graph.h:12, 2025-09-04T16:33:24,151 from networkit/cpp/flow/EdmondsKarp.h:11, 2025-09-04T16:33:24,151 from networkit/cpp/flow/EdmondsKarp.cpp:8: 2025-09-04T16:33:24,151 /usr/include/c++/14/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::_M_fill_insert(iterator, size_type, const value_type&) [with _Tp = long long unsigned int; _Alloc = std::allocator]’: 2025-09-04T16:33:24,152 /usr/include/c++/14/bits/vector.tcc:700:5: note: parameter passing for argument of type ‘std::vector::iterator’ changed in GCC 7.1 2025-09-04T16:33:24,152 700 | vector<_Tp, _Alloc>:: 2025-09-04T16:33:24,152 | ^~~~~~~~~~~~~~~~~~~ 2025-09-04T16:33:24,320 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/ParallelAgglomerativeClusterer.o networkit/cpp/community/ParallelAgglomerativeClusterer.cpp 2025-09-04T16:33:24,324 /usr/include/c++/14/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::_M_fill_insert(iterator, size_type, const value_type&) [with _Tp = double; _Alloc = std::allocator]’: 2025-09-04T16:33:24,324 /usr/include/c++/14/bits/vector.tcc:700:5: note: parameter passing for argument of type ‘std::vector::iterator’ changed in GCC 7.1 2025-09-04T16:33:24,443 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/PartitionIntersection.o networkit/cpp/community/PartitionIntersection.cpp 2025-09-04T16:33:25,442 In file included from /usr/include/c++/14/vector:66: 2025-09-04T16:33:25,443 In member function ‘void std::vector<_Tp, _Alloc>::resize(size_type, const value_type&) [with _Tp = long long unsigned int; _Alloc = std::allocator]’, 2025-09-04T16:33:25,443 inlined from ‘NetworKit::edgeweight NetworKit::EdmondsKarp::BFS(std::vector&, std::vector&) const’ at networkit/cpp/flow/EdmondsKarp.cpp:20:13: 2025-09-04T16:33:25,443 /usr/include/c++/14/bits/stl_vector.h:1037:25: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator >’ changed in GCC 7.1 2025-09-04T16:33:25,444 1037 | _M_fill_insert(end(), __new_size - size(), __x); 2025-09-04T16:33:25,444 | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:33:25,787 In member function ‘void std::vector<_Tp, _Alloc>::resize(size_type, const value_type&) [with _Tp = double; _Alloc = std::allocator]’, 2025-09-04T16:33:25,787 inlined from ‘void NetworKit::EdmondsKarp::run()’ at networkit/cpp/flow/EdmondsKarp.cpp:57:13: 2025-09-04T16:33:25,787 /usr/include/c++/14/bits/stl_vector.h:1037:25: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator >’ changed in GCC 7.1 2025-09-04T16:33:25,788 1037 | _M_fill_insert(end(), __new_size - size(), __x); 2025-09-04T16:33:25,788 | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:33:25,914 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/DissimilarityMeasure.o networkit/cpp/community/DissimilarityMeasure.cpp 2025-09-04T16:33:27,389 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/PLP.o networkit/cpp/community/PLP.cpp 2025-09-04T16:33:28,870 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/HubDominance.o networkit/cpp/community/HubDominance.cpp 2025-09-04T16:33:30,478 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/GraphStructuralRandMeasure.o networkit/cpp/community/GraphStructuralRandMeasure.cpp 2025-09-04T16:33:33,227 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/CommunityGraph.o networkit/cpp/community/CommunityGraph.cpp 2025-09-04T16:33:33,282 In file included from /usr/include/c++/14/set:62, 2025-09-04T16:33:33,282 from networkit/cpp/community/../structures/Partition.h:12, 2025-09-04T16:33:33,282 from networkit/cpp/community/CommunityDetectionAlgorithm.h:11, 2025-09-04T16:33:33,282 from networkit/cpp/community/PLP.h:11, 2025-09-04T16:33:33,283 from networkit/cpp/community/PLP.cpp:8: 2025-09-04T16:33:33,283 /usr/include/c++/14/bits/stl_tree.h: In function ‘std::pair std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_get_insert_hint_unique_pos(const_iterator, const key_type&) [with _Key = long long unsigned int; _Val = std::pair; _KeyOfValue = std::_Select1st >; _Compare = std::less; _Alloc = std::allocator >]’: 2025-09-04T16:33:33,283 /usr/include/c++/14/bits/stl_tree.h:2208:5: note: parameter passing for argument of type ‘std::_Rb_tree, std::_Select1st >, std::less, std::allocator > >::const_iterator’ changed in GCC 7.1 2025-09-04T16:33:33,283 2208 | _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>:: 2025-09-04T16:33:33,283 | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:33:34,529 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/Conductance.o networkit/cpp/community/Conductance.cpp 2025-09-04T16:33:34,996 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/RandomClusterer.o networkit/cpp/community/RandomClusterer.cpp 2025-09-04T16:33:35,818 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/GraphClusteringTools.o networkit/cpp/community/GraphClusteringTools.cpp 2025-09-04T16:33:38,923 In file included from networkit/cpp/community/RandomClusterer.h:11, 2025-09-04T16:33:38,924 from networkit/cpp/community/RandomClusterer.cpp:8: 2025-09-04T16:33:38,924 networkit/cpp/community/CommunityDetectionAlgorithm.h:42:22: warning: ‘virtual void NetworKit::CommunityDetectionAlgorithm::run()’ was hidden [-Woverloaded-virtual=] 2025-09-04T16:33:38,924 42 | virtual void run() = 0; 2025-09-04T16:33:38,925 | ^~~ 2025-09-04T16:33:38,925 networkit/cpp/community/RandomClusterer.h:22:27: note: by ‘virtual NetworKit::Partition NetworKit::RandomClusterer::run(NetworKit::Graph&)’ 2025-09-04T16:33:38,925 22 | virtual Partition run(Graph& G); 2025-09-04T16:33:38,926 | ^~~ 2025-09-04T16:33:39,060 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/LPDegreeOrdered.o networkit/cpp/community/LPDegreeOrdered.cpp 2025-09-04T16:33:39,412 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/CommunityDetectionAlgorithm.o networkit/cpp/community/CommunityDetectionAlgorithm.cpp 2025-09-04T16:33:39,562 In file included from /usr/include/c++/14/set:62, 2025-09-04T16:33:39,562 from networkit/cpp/community/../structures/Partition.h:12, 2025-09-04T16:33:39,563 from networkit/cpp/community/CommunityGraph.h:11, 2025-09-04T16:33:39,563 from networkit/cpp/community/CommunityGraph.cpp:8: 2025-09-04T16:33:39,563 /usr/include/c++/14/bits/stl_tree.h: In function ‘std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_emplace_hint_unique(const_iterator, _Args&& ...) [with _Args = {const std::piecewise_construct_t&, std::tuple, std::tuple<>}; _Key = long long unsigned int; _Val = std::pair; _KeyOfValue = std::_Select1st >; _Compare = std::less; _Alloc = std::allocator >]’: 2025-09-04T16:33:39,563 /usr/include/c++/14/bits/stl_tree.h:2456:7: note: parameter passing for argument of type ‘std::_Rb_tree, std::_Select1st >, std::less, std::allocator > >::const_iterator’ changed in GCC 7.1 2025-09-04T16:33:39,563 2456 | _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>:: 2025-09-04T16:33:39,564 | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:33:39,645 In file included from /usr/include/c++/14/map:63, 2025-09-04T16:33:39,646 from networkit/cpp/community/../structures/Partition.h:14: 2025-09-04T16:33:39,646 In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = long long unsigned int; _Tp = long long unsigned int; _Compare = std::less; _Alloc = std::allocator >]’, 2025-09-04T16:33:39,646 inlined from ‘virtual std::map NetworKit::CommunityGraph::getCommunityToNodeMap()’ at networkit/cpp/community/CommunityGraph.cpp:67:26: 2025-09-04T16:33:39,646 /usr/include/c++/14/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree, std::_Select1st >, std::less, std::allocator > >::const_iterator’ changed in GCC 7.1 2025-09-04T16:33:39,647 513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct, 2025-09-04T16:33:39,647 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:33:39,647 514 | std::tuple(__k), 2025-09-04T16:33:39,647 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:33:39,647 515 | std::tuple<>()); 2025-09-04T16:33:39,647 | ~~~~~~~~~~~~~~~ 2025-09-04T16:33:39,701 In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = long long unsigned int; _Tp = long long unsigned int; _Compare = std::less; _Alloc = std::allocator >]’, 2025-09-04T16:33:39,702 inlined from ‘virtual std::map NetworKit::CommunityGraph::getNodeToCommunityMap()’ at networkit/cpp/community/CommunityGraph.cpp:79:24: 2025-09-04T16:33:39,702 /usr/include/c++/14/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree, std::_Select1st >, std::less, std::allocator > >::const_iterator’ changed in GCC 7.1 2025-09-04T16:33:39,702 513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct, 2025-09-04T16:33:39,702 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:33:39,702 514 | std::tuple(__k), 2025-09-04T16:33:39,703 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:33:39,703 515 | std::tuple<>()); 2025-09-04T16:33:39,703 | ~~~~~~~~~~~~~~~ 2025-09-04T16:33:40,012 In file included from /usr/include/c++/14/vector:72, 2025-09-04T16:33:40,013 from networkit/cpp/community/../structures/Partition.h:13: 2025-09-04T16:33:40,013 /usr/include/c++/14/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::_M_fill_insert(iterator, size_type, const value_type&) [with _Tp = long long unsigned int; _Alloc = std::allocator]’: 2025-09-04T16:33:40,013 /usr/include/c++/14/bits/vector.tcc:700:5: note: parameter passing for argument of type ‘std::vector::iterator’ changed in GCC 7.1 2025-09-04T16:33:40,014 700 | vector<_Tp, _Alloc>:: 2025-09-04T16:33:40,014 | ^~~~~~~~~~~~~~~~~~~ 2025-09-04T16:33:40,841 In file included from /usr/include/c++/14/vector:66: 2025-09-04T16:33:40,842 In member function ‘void std::vector<_Tp, _Alloc>::resize(size_type, const value_type&) [with _Tp = long long unsigned int; _Alloc = std::allocator]’, 2025-09-04T16:33:40,842 inlined from ‘virtual void NetworKit::CommunityGraph::run(const NetworKit::Graph&, const NetworKit::Partition&)’ at networkit/cpp/community/CommunityGraph.cpp:19:29: 2025-09-04T16:33:40,842 /usr/include/c++/14/bits/stl_vector.h:1037:25: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator >’ changed in GCC 7.1 2025-09-04T16:33:40,842 1037 | _M_fill_insert(end(), __new_size - size(), __x); 2025-09-04T16:33:40,843 | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:33:42,370 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/SampledNodeStructuralRandMeasure.o networkit/cpp/community/SampledNodeStructuralRandMeasure.cpp 2025-09-04T16:33:43,425 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/ClusteringGenerator.o networkit/cpp/community/ClusteringGenerator.cpp 2025-09-04T16:33:44,063 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/NodeStructuralRandMeasure.o networkit/cpp/community/NodeStructuralRandMeasure.cpp 2025-09-04T16:33:44,652 In file included from /usr/include/c++/14/bits/stl_algo.h:61, 2025-09-04T16:33:44,652 from /usr/include/c++/14/algorithm:61, 2025-09-04T16:33:44,652 from networkit/cpp/community/../structures/../graph/Graph.h:11, 2025-09-04T16:33:44,653 from networkit/cpp/community/../structures/Partition.h:18, 2025-09-04T16:33:44,653 from networkit/cpp/community/CommunityDetectionAlgorithm.h:11, 2025-09-04T16:33:44,653 from networkit/cpp/community/LPDegreeOrdered.h:11, 2025-09-04T16:33:44,653 from networkit/cpp/community/LPDegreeOrdered.cpp:10: 2025-09-04T16:33:44,653 /usr/include/c++/14/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator >; _Distance = int; _Tp = long long unsigned int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter >]’: 2025-09-04T16:33:44,654 /usr/include/c++/14/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator >’ changed in GCC 7.1 2025-09-04T16:33:44,654 224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex, 2025-09-04T16:33:44,654 | ^~~~~~~~~~~~~ 2025-09-04T16:33:44,769 /usr/include/c++/14/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter >]’: 2025-09-04T16:33:44,769 /usr/include/c++/14/bits/stl_algo.h:1876:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator >’ changed in GCC 7.1 2025-09-04T16:33:44,769 1876 | __introsort_loop(_RandomAccessIterator __first, 2025-09-04T16:33:44,769 | ^~~~~~~~~~~~~~~~ 2025-09-04T16:33:44,770 /usr/include/c++/14/bits/stl_algo.h:1876:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator >’ changed in GCC 7.1 2025-09-04T16:33:44,772 /usr/include/c++/14/bits/stl_algo.h:1890:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator >’ changed in GCC 7.1 2025-09-04T16:33:44,772 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); 2025-09-04T16:33:44,772 | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:33:44,931 /usr/include/c++/14/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter >]’: 2025-09-04T16:33:44,931 /usr/include/c++/14/bits/stl_algo.h:1770:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator >’ changed in GCC 7.1 2025-09-04T16:33:44,931 1770 | __insertion_sort(_RandomAccessIterator __first, 2025-09-04T16:33:44,932 | ^~~~~~~~~~~~~~~~ 2025-09-04T16:33:44,932 /usr/include/c++/14/bits/stl_algo.h:1770:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator >’ changed in GCC 7.1 2025-09-04T16:33:45,843 In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter >]’, 2025-09-04T16:33:45,843 inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator >; _Compare = NetworKit::LPDegreeOrdered::run()::]’ at /usr/include/c++/14/bits/stl_algo.h:4805:18, 2025-09-04T16:33:45,843 inlined from ‘virtual void NetworKit::LPDegreeOrdered::run()’ at networkit/cpp/community/LPDegreeOrdered.cpp:68:11: 2025-09-04T16:33:45,844 /usr/include/c++/14/bits/stl_algo.h:1905:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator >’ changed in GCC 7.1 2025-09-04T16:33:45,844 1905 | std::__introsort_loop(__first, __last, 2025-09-04T16:33:45,844 | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 2025-09-04T16:33:45,844 1906 | std::__lg(__last - __first) * 2, 2025-09-04T16:33:45,844 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:33:45,844 1907 | __comp); 2025-09-04T16:33:45,845 | ~~~~~~~ 2025-09-04T16:33:45,845 In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter >]’, 2025-09-04T16:33:45,846 inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter >]’ at /usr/include/c++/14/bits/stl_algo.h:1908:31, 2025-09-04T16:33:45,846 inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator >; _Compare = NetworKit::LPDegreeOrdered::run()::]’ at /usr/include/c++/14/bits/stl_algo.h:4805:18, 2025-09-04T16:33:45,846 inlined from ‘virtual void NetworKit::LPDegreeOrdered::run()’ at networkit/cpp/community/LPDegreeOrdered.cpp:68:11: 2025-09-04T16:33:45,847 /usr/include/c++/14/bits/stl_algo.h:1817:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator >’ changed in GCC 7.1 2025-09-04T16:33:45,847 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); 2025-09-04T16:33:45,847 | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:33:45,849 /usr/include/c++/14/bits/stl_algo.h:1822:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator >’ changed in GCC 7.1 2025-09-04T16:33:45,849 1822 | std::__insertion_sort(__first, __last, __comp); 2025-09-04T16:33:45,849 | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:33:46,659 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/QualityMeasure.o networkit/cpp/community/QualityMeasure.cpp 2025-09-04T16:33:46,971 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/Coverage.o networkit/cpp/community/Coverage.cpp 2025-09-04T16:33:48,627 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/PLM.o networkit/cpp/community/PLM.cpp 2025-09-04T16:33:48,720 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/JaccardMeasure.o networkit/cpp/community/JaccardMeasure.cpp 2025-09-04T16:33:50,831 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/Modularity.o networkit/cpp/community/Modularity.cpp 2025-09-04T16:33:52,476 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/NMIDistance.o networkit/cpp/community/NMIDistance.cpp 2025-09-04T16:33:53,378 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/CNM.o networkit/cpp/community/CNM.cpp 2025-09-04T16:33:55,777 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/EdgeCut.o networkit/cpp/community/EdgeCut.cpp 2025-09-04T16:33:55,907 In file included from /usr/include/c++/14/set:62, 2025-09-04T16:33:55,907 from networkit/cpp/community/../structures/Partition.h:12, 2025-09-04T16:33:55,908 from networkit/cpp/community/CommunityDetectionAlgorithm.h:11, 2025-09-04T16:33:55,908 from networkit/cpp/community/PLM.h:11, 2025-09-04T16:33:55,909 from networkit/cpp/community/PLM.cpp:8: 2025-09-04T16:33:55,909 /usr/include/c++/14/bits/stl_tree.h: In function ‘std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_emplace_hint_unique(const_iterator, _Args&& ...) [with _Args = {const std::piecewise_construct_t&, std::tuple, std::tuple<>}; _Key = long long unsigned int; _Val = std::pair; _KeyOfValue = std::_Select1st >; _Compare = std::less; _Alloc = std::allocator >]’: 2025-09-04T16:33:55,909 /usr/include/c++/14/bits/stl_tree.h:2456:7: note: parameter passing for argument of type ‘std::_Rb_tree, std::_Select1st >, std::less, std::allocator > >::const_iterator’ changed in GCC 7.1 2025-09-04T16:33:55,910 2456 | _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>:: 2025-09-04T16:33:55,910 | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:33:56,485 networkit/cpp/community/NMIDistance.cpp: In member function ‘virtual double NetworKit::NMIDistance::getDissimilarity(const NetworKit::Graph&, const NetworKit::Partition&, const NetworKit::Partition&)’: 2025-09-04T16:33:56,485 networkit/cpp/community/NMIDistance.cpp:85:14: warning: variable ‘unionSize’ set but not used [-Wunused-but-set-variable] 2025-09-04T16:33:56,486 85 | auto unionSize = [&](index C, index D){ 2025-09-04T16:33:56,486 | ^~~~~~~~~ 2025-09-04T16:33:56,793 In file included from /usr/include/c++/14/map:63, 2025-09-04T16:33:56,794 from networkit/cpp/community/../structures/Partition.h:14: 2025-09-04T16:33:56,794 In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = long long unsigned int; _Tp = double; _Compare = std::less; _Alloc = std::allocator >]’, 2025-09-04T16:33:56,794 inlined from ‘NetworKit::PLM::run()::::’ at networkit/cpp/community/PLM.cpp:114:16, 2025-09-04T16:33:56,794 inlined from ‘decltype (f(u, ew)) NetworKit::Graph::edgeLambda(F&, NetworKit::node, NetworKit::node, NetworKit::edgeweight, NetworKit::edgeid) const [with F = NetworKit::PLM::run()::::; bool InEdges = false; typename std::enable_if<((Aux::FunctionTraits::arity >= 1) && std::is_same::arg<1>::type>::value)>::type* = 0]’ at networkit/cpp/community/../structures/../graph/Graph.h:279:12, 2025-09-04T16:33:56,795 inlined from ‘void NetworKit::Graph::forOutEdgesOfImpl(NetworKit::node, L) const [with bool graphIsDirected = true; bool hasWeights = false; bool graphHasEdgeIds = false; L = NetworKit::PLM::run()::::]’ at networkit/cpp/community/../structures/../graph/Graph.h:1052:24, 2025-09-04T16:33:56,795 inlined from ‘void NetworKit::Graph::forEdgesOf(NetworKit::node, L) const [with L = NetworKit::PLM::run()::::]’ at networkit/cpp/community/../structures/../graph/Graph.h:1202:43, 2025-09-04T16:33:56,795 inlined from ‘void NetworKit::Graph::forNeighborsOf(NetworKit::node, L) const [with L = NetworKit::PLM::run()::::]’ at networkit/cpp/community/../structures/../graph/Graph.h:1195:12, 2025-09-04T16:33:56,795 inlined from ‘NetworKit::PLM::run()::’ at networkit/cpp/community/PLM.cpp:111:20: 2025-09-04T16:33:56,796 /usr/include/c++/14/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree, std::_Select1st >, std::less, std::allocator > >::const_iterator’ changed in GCC 7.1 2025-09-04T16:33:56,796 513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct, 2025-09-04T16:33:56,796 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:33:56,796 514 | std::tuple(__k), 2025-09-04T16:33:56,797 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:33:56,797 515 | std::tuple<>()); 2025-09-04T16:33:56,797 | ~~~~~~~~~~~~~~~ 2025-09-04T16:33:56,797 In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = long long unsigned int; _Tp = double; _Compare = std::less; _Alloc = std::allocator >]’, 2025-09-04T16:33:56,798 inlined from ‘NetworKit::PLM::run()::::’ at networkit/cpp/community/PLM.cpp:114:16, 2025-09-04T16:33:56,798 inlined from ‘decltype (f(u, ew)) NetworKit::Graph::edgeLambda(F&, NetworKit::node, NetworKit::node, NetworKit::edgeweight, NetworKit::edgeid) const [with F = NetworKit::PLM::run()::::; bool InEdges = false; typename std::enable_if<((Aux::FunctionTraits::arity >= 1) && std::is_same::arg<1>::type>::value)>::type* = 0]’ at networkit/cpp/community/../structures/../graph/Graph.h:279:12, 2025-09-04T16:33:56,798 inlined from ‘void NetworKit::Graph::forOutEdgesOfImpl(NetworKit::node, L) const [with bool graphIsDirected = true; bool hasWeights = true; bool graphHasEdgeIds = false; L = NetworKit::PLM::run()::::]’ at networkit/cpp/community/../structures/../graph/Graph.h:1052:24, 2025-09-04T16:33:56,798 inlined from ‘void NetworKit::Graph::forEdgesOf(NetworKit::node, L) const [with L = NetworKit::PLM::run()::::]’ at networkit/cpp/community/../structures/../graph/Graph.h:1206:42, 2025-09-04T16:33:56,798 inlined from ‘void NetworKit::Graph::forNeighborsOf(NetworKit::node, L) const [with L = NetworKit::PLM::run()::::]’ at networkit/cpp/community/../structures/../graph/Graph.h:1195:12, 2025-09-04T16:33:56,799 inlined from ‘NetworKit::PLM::run()::’ at networkit/cpp/community/PLM.cpp:111:20: 2025-09-04T16:33:56,799 /usr/include/c++/14/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree, std::_Select1st >, std::less, std::allocator > >::const_iterator’ changed in GCC 7.1 2025-09-04T16:33:56,799 513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct, 2025-09-04T16:33:56,799 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:33:56,800 514 | std::tuple(__k), 2025-09-04T16:33:56,800 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:33:56,800 515 | std::tuple<>()); 2025-09-04T16:33:56,800 | ~~~~~~~~~~~~~~~ 2025-09-04T16:33:56,800 In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = long long unsigned int; _Tp = double; _Compare = std::less; _Alloc = std::allocator >]’, 2025-09-04T16:33:56,801 inlined from ‘NetworKit::PLM::run()::::’ at networkit/cpp/community/PLM.cpp:114:16, 2025-09-04T16:33:56,801 inlined from ‘decltype (f(u, ew)) NetworKit::Graph::edgeLambda(F&, NetworKit::node, NetworKit::node, NetworKit::edgeweight, NetworKit::edgeid) const [with F = NetworKit::PLM::run()::::; bool InEdges = false; typename std::enable_if<((Aux::FunctionTraits::arity >= 1) && std::is_same::arg<1>::type>::value)>::type* = 0]’ at networkit/cpp/community/../structures/../graph/Graph.h:279:12, 2025-09-04T16:33:56,801 inlined from ‘void NetworKit::Graph::forOutEdgesOfImpl(NetworKit::node, L) const [with bool graphIsDirected = true; bool hasWeights = false; bool graphHasEdgeIds = false; L = NetworKit::PLM::run()::::]’ at networkit/cpp/community/../structures/../graph/Graph.h:1052:24, 2025-09-04T16:33:56,802 inlined from ‘void NetworKit::Graph::forEdgesOf(NetworKit::node, L) const [with L = NetworKit::PLM::run()::::]’ at networkit/cpp/community/../structures/../graph/Graph.h:1210:42, 2025-09-04T16:33:56,802 inlined from ‘void NetworKit::Graph::forNeighborsOf(NetworKit::node, L) const [with L = NetworKit::PLM::run()::::]’ at networkit/cpp/community/../structures/../graph/Graph.h:1195:12, 2025-09-04T16:33:56,802 inlined from ‘NetworKit::PLM::run()::’ at networkit/cpp/community/PLM.cpp:111:20: 2025-09-04T16:33:56,802 /usr/include/c++/14/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree, std::_Select1st >, std::less, std::allocator > >::const_iterator’ changed in GCC 7.1 2025-09-04T16:33:56,803 513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct, 2025-09-04T16:33:56,803 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:33:56,803 514 | std::tuple(__k), 2025-09-04T16:33:56,803 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:33:56,803 515 | std::tuple<>()); 2025-09-04T16:33:56,804 | ~~~~~~~~~~~~~~~ 2025-09-04T16:33:56,804 In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = long long unsigned int; _Tp = double; _Compare = std::less; _Alloc = std::allocator >]’, 2025-09-04T16:33:56,804 inlined from ‘NetworKit::PLM::run()::::’ at networkit/cpp/community/PLM.cpp:114:16, 2025-09-04T16:33:56,804 inlined from ‘decltype (f(u, ew)) NetworKit::Graph::edgeLambda(F&, NetworKit::node, NetworKit::node, NetworKit::edgeweight, NetworKit::edgeid) const [with F = NetworKit::PLM::run()::::; bool InEdges = false; typename std::enable_if<((Aux::FunctionTraits::arity >= 1) && std::is_same::arg<1>::type>::value)>::type* = 0]’ at networkit/cpp/community/../structures/../graph/Graph.h:279:12, 2025-09-04T16:33:56,805 inlined from ‘void NetworKit::Graph::forOutEdgesOfImpl(NetworKit::node, L) const [with bool graphIsDirected = true; bool hasWeights = true; bool graphHasEdgeIds = false; L = NetworKit::PLM::run()::::]’ at networkit/cpp/community/../structures/../graph/Graph.h:1052:24, 2025-09-04T16:33:56,805 inlined from ‘void NetworKit::Graph::forEdgesOf(NetworKit::node, L) const [with L = NetworKit::PLM::run()::::]’ at networkit/cpp/community/../structures/../graph/Graph.h:1214:41, 2025-09-04T16:33:56,805 inlined from ‘void NetworKit::Graph::forNeighborsOf(NetworKit::node, L) const [with L = NetworKit::PLM::run()::::]’ at networkit/cpp/community/../structures/../graph/Graph.h:1195:12, 2025-09-04T16:33:56,805 inlined from ‘NetworKit::PLM::run()::’ at networkit/cpp/community/PLM.cpp:111:20: 2025-09-04T16:33:56,805 /usr/include/c++/14/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree, std::_Select1st >, std::less, std::allocator > >::const_iterator’ changed in GCC 7.1 2025-09-04T16:33:56,806 513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct, 2025-09-04T16:33:56,806 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:33:56,806 514 | std::tuple(__k), 2025-09-04T16:33:56,806 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:33:56,807 515 | std::tuple<>()); 2025-09-04T16:33:56,807 | ~~~~~~~~~~~~~~~ 2025-09-04T16:33:56,807 In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = long long unsigned int; _Tp = double; _Compare = std::less; _Alloc = std::allocator >]’, 2025-09-04T16:33:56,807 inlined from ‘NetworKit::PLM::run()::’ at networkit/cpp/community/PLM.cpp:172:37: 2025-09-04T16:33:56,807 /usr/include/c++/14/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree, std::_Select1st >, std::less, std::allocator > >::const_iterator’ changed in GCC 7.1 2025-09-04T16:33:56,808 513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct, 2025-09-04T16:33:56,808 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:33:56,808 514 | std::tuple(__k), 2025-09-04T16:33:56,808 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:33:56,809 515 | std::tuple<>()); 2025-09-04T16:33:56,809 | ~~~~~~~~~~~~~~~ 2025-09-04T16:33:58,209 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/DynamicNMIDistance.o networkit/cpp/community/DynamicNMIDistance.cpp 2025-09-04T16:33:59,117 In file included from /usr/include/c++/14/vector:72, 2025-09-04T16:33:59,118 from networkit/cpp/community/../structures/Partition.h:13: 2025-09-04T16:33:59,118 /usr/include/c++/14/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::_M_fill_insert(iterator, size_type, const value_type&) [with _Tp = double; _Alloc = std::allocator]’: 2025-09-04T16:33:59,118 /usr/include/c++/14/bits/vector.tcc:700:5: note: parameter passing for argument of type ‘std::vector::iterator’ changed in GCC 7.1 2025-09-04T16:33:59,119 700 | vector<_Tp, _Alloc>:: 2025-09-04T16:33:59,119 | ^~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:00,237 In file included from /usr/include/c++/14/vector:66: 2025-09-04T16:34:00,237 In member function ‘void std::vector<_Tp, _Alloc>::resize(size_type, const value_type&) [with _Tp = double; _Alloc = std::allocator]’, 2025-09-04T16:34:00,238 inlined from ‘virtual void NetworKit::PLM::run()’ at networkit/cpp/community/PLM.cpp:280:23: 2025-09-04T16:34:00,238 /usr/include/c++/14/bits/stl_vector.h:1037:25: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator >’ changed in GCC 7.1 2025-09-04T16:34:00,238 1037 | _M_fill_insert(end(), __new_size - size(), __x); 2025-09-04T16:34:00,238 | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:00,771 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/EPPFactory.o networkit/cpp/community/EPPFactory.cpp 2025-09-04T16:34:01,389 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/CutClustering.o networkit/cpp/community/CutClustering.cpp 2025-09-04T16:34:02,362 In file included from /usr/include/c++/14/set:62, 2025-09-04T16:34:02,363 from networkit/cpp/community/../structures/Partition.h:12, 2025-09-04T16:34:02,363 from networkit/cpp/community/CommunityDetectionAlgorithm.h:11, 2025-09-04T16:34:02,363 from networkit/cpp/community/CNM.h:11, 2025-09-04T16:34:02,363 from networkit/cpp/community/CNM.cpp:8: 2025-09-04T16:34:02,364 /usr/include/c++/14/bits/stl_tree.h: In function ‘std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_emplace_hint_unique(const_iterator, _Args&& ...) [with _Args = {const std::piecewise_construct_t&, std::tuple&&>, std::tuple<>}; _Key = std::pair; _Val = std::pair, long long unsigned int>; _KeyOfValue = std::_Select1st, long long unsigned int> >; _Compare = std::less >; _Alloc = std::allocator, long long unsigned int> >]’: 2025-09-04T16:34:02,364 /usr/include/c++/14/bits/stl_tree.h:2456:7: note: parameter passing for argument of type ‘std::_Rb_tree, std::pair, long long unsigned int>, std::_Select1st, long long unsigned int> >, std::less >, std::allocator, long long unsigned int> > >::const_iterator’ changed in GCC 7.1 2025-09-04T16:34:02,364 2456 | _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>:: 2025-09-04T16:34:02,364 | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:04,116 In file included from /usr/include/c++/14/vector:72, 2025-09-04T16:34:04,117 from networkit/cpp/community/../structures/Partition.h:13, 2025-09-04T16:34:04,117 from networkit/cpp/community/DissimilarityMeasure.h:11, 2025-09-04T16:34:04,118 from networkit/cpp/community/DynamicNMIDistance.h:11, 2025-09-04T16:34:04,118 from networkit/cpp/community/DynamicNMIDistance.cpp:8: 2025-09-04T16:34:04,118 /usr/include/c++/14/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::_M_fill_insert(iterator, size_type, const value_type&) [with _Tp = long long unsigned int; _Alloc = std::allocator]’: 2025-09-04T16:34:04,119 /usr/include/c++/14/bits/vector.tcc:700:5: note: parameter passing for argument of type ‘std::vector::iterator’ changed in GCC 7.1 2025-09-04T16:34:04,119 700 | vector<_Tp, _Alloc>:: 2025-09-04T16:34:04,119 | ^~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:04,245 In file included from /usr/include/c++/14/vector:66: 2025-09-04T16:34:04,245 In member function ‘void std::vector<_Tp, _Alloc>::resize(size_type, const value_type&) [with _Tp = long long unsigned int; _Alloc = std::allocator]’, 2025-09-04T16:34:04,245 inlined from ‘std::vector > NetworKit::DynamicNMIDistance::confusionMatrix(const NetworKit::Graph&, const NetworKit::Partition&, const NetworKit::Partition&)’ at networkit/cpp/community/DynamicNMIDistance.cpp:194:23: 2025-09-04T16:34:04,245 /usr/include/c++/14/bits/stl_vector.h:1037:25: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator >’ changed in GCC 7.1 2025-09-04T16:34:04,246 1037 | _M_fill_insert(end(), __new_size - size(), __x); 2025-09-04T16:34:04,246 | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:04,704 In file included from /usr/include/c++/14/map:63, 2025-09-04T16:34:04,704 from networkit/cpp/community/../structures/Partition.h:14: 2025-09-04T16:34:04,704 In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](key_type&&) [with _Key = std::pair; _Tp = long long unsigned int; _Compare = std::less >; _Alloc = std::allocator, long long unsigned int> >]’, 2025-09-04T16:34:04,704 inlined from ‘NetworKit::CNM::run()::’ at networkit/cpp/community/CNM.cpp:138:54, 2025-09-04T16:34:04,705 inlined from ‘decltype (f(u, v)) NetworKit::Graph::edgeLambda(F&, NetworKit::node, NetworKit::node, NetworKit::edgeweight, NetworKit::edgeid) const [with F = NetworKit::CNM::run()::; bool InEdges = false; typename std::enable_if<((Aux::FunctionTraits::arity >= 1) && std::is_same::arg<1>::type>::value)>::type* = 0]’ at networkit/cpp/community/../structures/../graph/Graph.h:262:12, 2025-09-04T16:34:04,705 inlined from ‘void NetworKit::Graph::forOutEdgesOfImpl(NetworKit::node, L) const [with bool graphIsDirected = true; bool hasWeights = false; bool graphHasEdgeIds = false; L = NetworKit::CNM::run()::]’ at networkit/cpp/community/../structures/../graph/Graph.h:1052:24, 2025-09-04T16:34:04,705 inlined from ‘void NetworKit::Graph::forEdgesOf(NetworKit::node, L) const [with L = NetworKit::CNM::run()::]’ at networkit/cpp/community/../structures/../graph/Graph.h:1202:43, 2025-09-04T16:34:04,705 inlined from ‘virtual void NetworKit::CNM::run()’ at networkit/cpp/community/CNM.cpp:137:19: 2025-09-04T16:34:04,706 /usr/include/c++/14/bits/stl_map.h:532:44: note: parameter passing for argument of type ‘std::_Rb_tree, std::pair, long long unsigned int>, std::_Select1st, long long unsigned int> >, std::less >, std::allocator, long long unsigned int> > >::const_iterator’ changed in GCC 7.1 2025-09-04T16:34:04,706 532 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct, 2025-09-04T16:34:04,706 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:04,706 533 | std::forward_as_tuple(std::move(__k)), 2025-09-04T16:34:04,707 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:04,707 534 | std::tuple<>()); 2025-09-04T16:34:04,707 | ~~~~~~~~~~~~~~~ 2025-09-04T16:34:04,707 In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](key_type&&) [with _Key = std::pair; _Tp = long long unsigned int; _Compare = std::less >; _Alloc = std::allocator, long long unsigned int> >]’, 2025-09-04T16:34:04,708 inlined from ‘NetworKit::CNM::run()::’ at networkit/cpp/community/CNM.cpp:138:54, 2025-09-04T16:34:04,708 inlined from ‘decltype (f(u, v)) NetworKit::Graph::edgeLambda(F&, NetworKit::node, NetworKit::node, NetworKit::edgeweight, NetworKit::edgeid) const [with F = NetworKit::CNM::run()::; bool InEdges = false; typename std::enable_if<((Aux::FunctionTraits::arity >= 1) && std::is_same::arg<1>::type>::value)>::type* = 0]’ at networkit/cpp/community/../structures/../graph/Graph.h:262:12, 2025-09-04T16:34:04,708 inlined from ‘void NetworKit::Graph::forOutEdgesOfImpl(NetworKit::node, L) const [with bool graphIsDirected = true; bool hasWeights = false; bool graphHasEdgeIds = false; L = NetworKit::CNM::run()::]’ at networkit/cpp/community/../structures/../graph/Graph.h:1052:24, 2025-09-04T16:34:04,709 inlined from ‘void NetworKit::Graph::forEdgesOf(NetworKit::node, L) const [with L = NetworKit::CNM::run()::]’ at networkit/cpp/community/../structures/../graph/Graph.h:1206:42, 2025-09-04T16:34:04,709 inlined from ‘virtual void NetworKit::CNM::run()’ at networkit/cpp/community/CNM.cpp:137:19: 2025-09-04T16:34:04,709 /usr/include/c++/14/bits/stl_map.h:532:44: note: parameter passing for argument of type ‘std::_Rb_tree, std::pair, long long unsigned int>, std::_Select1st, long long unsigned int> >, std::less >, std::allocator, long long unsigned int> > >::const_iterator’ changed in GCC 7.1 2025-09-04T16:34:04,709 532 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct, 2025-09-04T16:34:04,709 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:04,709 533 | std::forward_as_tuple(std::move(__k)), 2025-09-04T16:34:04,710 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:04,710 534 | std::tuple<>()); 2025-09-04T16:34:04,710 | ~~~~~~~~~~~~~~~ 2025-09-04T16:34:04,710 In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](key_type&&) [with _Key = std::pair; _Tp = long long unsigned int; _Compare = std::less >; _Alloc = std::allocator, long long unsigned int> >]’, 2025-09-04T16:34:04,711 inlined from ‘NetworKit::CNM::run()::’ at networkit/cpp/community/CNM.cpp:138:54, 2025-09-04T16:34:04,711 inlined from ‘decltype (f(u, v)) NetworKit::Graph::edgeLambda(F&, NetworKit::node, NetworKit::node, NetworKit::edgeweight, NetworKit::edgeid) const [with F = NetworKit::CNM::run()::; bool InEdges = false; typename std::enable_if<((Aux::FunctionTraits::arity >= 1) && std::is_same::arg<1>::type>::value)>::type* = 0]’ at networkit/cpp/community/../structures/../graph/Graph.h:262:12, 2025-09-04T16:34:04,711 inlined from ‘void NetworKit::Graph::forOutEdgesOfImpl(NetworKit::node, L) const [with bool graphIsDirected = true; bool hasWeights = false; bool graphHasEdgeIds = false; L = NetworKit::CNM::run()::]’ at networkit/cpp/community/../structures/../graph/Graph.h:1052:24, 2025-09-04T16:34:04,711 inlined from ‘void NetworKit::Graph::forEdgesOf(NetworKit::node, L) const [with L = NetworKit::CNM::run()::]’ at networkit/cpp/community/../structures/../graph/Graph.h:1210:42, 2025-09-04T16:34:04,712 inlined from ‘virtual void NetworKit::CNM::run()’ at networkit/cpp/community/CNM.cpp:137:19: 2025-09-04T16:34:04,712 /usr/include/c++/14/bits/stl_map.h:532:44: note: parameter passing for argument of type ‘std::_Rb_tree, std::pair, long long unsigned int>, std::_Select1st, long long unsigned int> >, std::less >, std::allocator, long long unsigned int> > >::const_iterator’ changed in GCC 7.1 2025-09-04T16:34:04,712 532 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct, 2025-09-04T16:34:04,712 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:04,713 533 | std::forward_as_tuple(std::move(__k)), 2025-09-04T16:34:04,713 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:04,713 534 | std::tuple<>()); 2025-09-04T16:34:04,713 | ~~~~~~~~~~~~~~~ 2025-09-04T16:34:04,713 In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](key_type&&) [with _Key = std::pair; _Tp = long long unsigned int; _Compare = std::less >; _Alloc = std::allocator, long long unsigned int> >]’, 2025-09-04T16:34:04,713 inlined from ‘NetworKit::CNM::run()::’ at networkit/cpp/community/CNM.cpp:138:54, 2025-09-04T16:34:04,714 inlined from ‘decltype (f(u, v)) NetworKit::Graph::edgeLambda(F&, NetworKit::node, NetworKit::node, NetworKit::edgeweight, NetworKit::edgeid) const [with F = NetworKit::CNM::run()::; bool InEdges = false; typename std::enable_if<((Aux::FunctionTraits::arity >= 1) && std::is_same::arg<1>::type>::value)>::type* = 0]’ at networkit/cpp/community/../structures/../graph/Graph.h:262:12, 2025-09-04T16:34:04,714 inlined from ‘void NetworKit::Graph::forOutEdgesOfImpl(NetworKit::node, L) const [with bool graphIsDirected = true; bool hasWeights = false; bool graphHasEdgeIds = false; L = NetworKit::CNM::run()::]’ at networkit/cpp/community/../structures/../graph/Graph.h:1052:24, 2025-09-04T16:34:04,714 inlined from ‘void NetworKit::Graph::forEdgesOf(NetworKit::node, L) const [with L = NetworKit::CNM::run()::]’ at networkit/cpp/community/../structures/../graph/Graph.h:1214:41, 2025-09-04T16:34:04,715 inlined from ‘virtual void NetworKit::CNM::run()’ at networkit/cpp/community/CNM.cpp:137:19: 2025-09-04T16:34:04,715 /usr/include/c++/14/bits/stl_map.h:532:44: note: parameter passing for argument of type ‘std::_Rb_tree, std::pair, long long unsigned int>, std::_Select1st, long long unsigned int> >, std::less >, std::allocator, long long unsigned int> > >::const_iterator’ changed in GCC 7.1 2025-09-04T16:34:04,715 532 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct, 2025-09-04T16:34:04,715 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:04,716 533 | std::forward_as_tuple(std::move(__k)), 2025-09-04T16:34:04,716 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:04,716 534 | std::tuple<>()); 2025-09-04T16:34:04,716 | ~~~~~~~~~~~~~~~ 2025-09-04T16:34:04,717 In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](key_type&&) [with _Key = std::pair; _Tp = long long unsigned int; _Compare = std::less >; _Alloc = std::allocator, long long unsigned int> >]’, 2025-09-04T16:34:04,717 inlined from ‘NetworKit::CNM::run()::’ at networkit/cpp/community/CNM.cpp:141:54, 2025-09-04T16:34:04,717 inlined from ‘decltype (f(u, v)) NetworKit::Graph::edgeLambda(F&, NetworKit::node, NetworKit::node, NetworKit::edgeweight, NetworKit::edgeid) const [with F = NetworKit::CNM::run()::; bool InEdges = false; typename std::enable_if<((Aux::FunctionTraits::arity >= 1) && std::is_same::arg<1>::type>::value)>::type* = 0]’ at networkit/cpp/community/../structures/../graph/Graph.h:262:12, 2025-09-04T16:34:04,717 inlined from ‘void NetworKit::Graph::forOutEdgesOfImpl(NetworKit::node, L) const [with bool graphIsDirected = true; bool hasWeights = false; bool graphHasEdgeIds = false; L = NetworKit::CNM::run()::]’ at networkit/cpp/community/../structures/../graph/Graph.h:1052:24, 2025-09-04T16:34:04,718 inlined from ‘void NetworKit::Graph::forEdgesOf(NetworKit::node, L) const [with L = NetworKit::CNM::run()::]’ at networkit/cpp/community/../structures/../graph/Graph.h:1202:43, 2025-09-04T16:34:04,718 inlined from ‘virtual void NetworKit::CNM::run()’ at networkit/cpp/community/CNM.cpp:140:19: 2025-09-04T16:34:04,718 /usr/include/c++/14/bits/stl_map.h:532:44: note: parameter passing for argument of type ‘std::_Rb_tree, std::pair, long long unsigned int>, std::_Select1st, long long unsigned int> >, std::less >, std::allocator, long long unsigned int> > >::const_iterator’ changed in GCC 7.1 2025-09-04T16:34:04,718 532 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct, 2025-09-04T16:34:04,718 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:04,719 533 | std::forward_as_tuple(std::move(__k)), 2025-09-04T16:34:04,719 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:04,719 534 | std::tuple<>()); 2025-09-04T16:34:04,719 | ~~~~~~~~~~~~~~~ 2025-09-04T16:34:04,719 In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](key_type&&) [with _Key = std::pair; _Tp = long long unsigned int; _Compare = std::less >; _Alloc = std::allocator, long long unsigned int> >]’, 2025-09-04T16:34:04,720 inlined from ‘NetworKit::CNM::run()::’ at networkit/cpp/community/CNM.cpp:141:54, 2025-09-04T16:34:04,720 inlined from ‘decltype (f(u, v)) NetworKit::Graph::edgeLambda(F&, NetworKit::node, NetworKit::node, NetworKit::edgeweight, NetworKit::edgeid) const [with F = NetworKit::CNM::run()::; bool InEdges = false; typename std::enable_if<((Aux::FunctionTraits::arity >= 1) && std::is_same::arg<1>::type>::value)>::type* = 0]’ at networkit/cpp/community/../structures/../graph/Graph.h:262:12, 2025-09-04T16:34:04,720 inlined from ‘void NetworKit::Graph::forOutEdgesOfImpl(NetworKit::node, L) const [with bool graphIsDirected = true; bool hasWeights = false; bool graphHasEdgeIds = false; L = NetworKit::CNM::run()::]’ at networkit/cpp/community/../structures/../graph/Graph.h:1052:24, 2025-09-04T16:34:04,721 inlined from ‘void NetworKit::Graph::forEdgesOf(NetworKit::node, L) const [with L = NetworKit::CNM::run()::]’ at networkit/cpp/community/../structures/../graph/Graph.h:1206:42, 2025-09-04T16:34:04,721 inlined from ‘virtual void NetworKit::CNM::run()’ at networkit/cpp/community/CNM.cpp:140:19: 2025-09-04T16:34:04,721 /usr/include/c++/14/bits/stl_map.h:532:44: note: parameter passing for argument of type ‘std::_Rb_tree, std::pair, long long unsigned int>, std::_Select1st, long long unsigned int> >, std::less >, std::allocator, long long unsigned int> > >::const_iterator’ changed in GCC 7.1 2025-09-04T16:34:04,742 532 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct, 2025-09-04T16:34:04,742 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:04,742 533 | std::forward_as_tuple(std::move(__k)), 2025-09-04T16:34:04,742 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:04,743 534 | std::tuple<>()); 2025-09-04T16:34:04,743 | ~~~~~~~~~~~~~~~ 2025-09-04T16:34:04,743 In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](key_type&&) [with _Key = std::pair; _Tp = long long unsigned int; _Compare = std::less >; _Alloc = std::allocator, long long unsigned int> >]’, 2025-09-04T16:34:04,743 inlined from ‘NetworKit::CNM::run()::’ at networkit/cpp/community/CNM.cpp:141:54, 2025-09-04T16:34:04,743 inlined from ‘decltype (f(u, v)) NetworKit::Graph::edgeLambda(F&, NetworKit::node, NetworKit::node, NetworKit::edgeweight, NetworKit::edgeid) const [with F = NetworKit::CNM::run()::; bool InEdges = false; typename std::enable_if<((Aux::FunctionTraits::arity >= 1) && std::is_same::arg<1>::type>::value)>::type* = 0]’ at networkit/cpp/community/../structures/../graph/Graph.h:262:12, 2025-09-04T16:34:04,744 inlined from ‘void NetworKit::Graph::forOutEdgesOfImpl(NetworKit::node, L) const [with bool graphIsDirected = true; bool hasWeights = false; bool graphHasEdgeIds = false; L = NetworKit::CNM::run()::]’ at networkit/cpp/community/../structures/../graph/Graph.h:1052:24, 2025-09-04T16:34:04,744 inlined from ‘void NetworKit::Graph::forEdgesOf(NetworKit::node, L) const [with L = NetworKit::CNM::run()::]’ at networkit/cpp/community/../structures/../graph/Graph.h:1210:42, 2025-09-04T16:34:04,744 inlined from ‘virtual void NetworKit::CNM::run()’ at networkit/cpp/community/CNM.cpp:140:19: 2025-09-04T16:34:04,745 /usr/include/c++/14/bits/stl_map.h:532:44: note: parameter passing for argument of type ‘std::_Rb_tree, std::pair, long long unsigned int>, std::_Select1st, long long unsigned int> >, std::less >, std::allocator, long long unsigned int> > >::const_iterator’ changed in GCC 7.1 2025-09-04T16:34:04,745 532 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct, 2025-09-04T16:34:04,745 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:04,746 533 | std::forward_as_tuple(std::move(__k)), 2025-09-04T16:34:04,746 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:04,747 534 | std::tuple<>()); 2025-09-04T16:34:04,747 | ~~~~~~~~~~~~~~~ 2025-09-04T16:34:04,747 In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](key_type&&) [with _Key = std::pair; _Tp = long long unsigned int; _Compare = std::less >; _Alloc = std::allocator, long long unsigned int> >]’, 2025-09-04T16:34:04,748 inlined from ‘NetworKit::CNM::run()::’ at networkit/cpp/community/CNM.cpp:141:54, 2025-09-04T16:34:04,748 inlined from ‘decltype (f(u, v)) NetworKit::Graph::edgeLambda(F&, NetworKit::node, NetworKit::node, NetworKit::edgeweight, NetworKit::edgeid) const [with F = NetworKit::CNM::run()::; bool InEdges = false; typename std::enable_if<((Aux::FunctionTraits::arity >= 1) && std::is_same::arg<1>::type>::value)>::type* = 0]’ at networkit/cpp/community/../structures/../graph/Graph.h:262:12, 2025-09-04T16:34:04,748 inlined from ‘void NetworKit::Graph::forOutEdgesOfImpl(NetworKit::node, L) const [with bool graphIsDirected = true; bool hasWeights = false; bool graphHasEdgeIds = false; L = NetworKit::CNM::run()::]’ at networkit/cpp/community/../structures/../graph/Graph.h:1052:24, 2025-09-04T16:34:04,749 inlined from ‘void NetworKit::Graph::forEdgesOf(NetworKit::node, L) const [with L = NetworKit::CNM::run()::]’ at networkit/cpp/community/../structures/../graph/Graph.h:1214:41, 2025-09-04T16:34:04,749 inlined from ‘virtual void NetworKit::CNM::run()’ at networkit/cpp/community/CNM.cpp:140:19: 2025-09-04T16:34:04,749 /usr/include/c++/14/bits/stl_map.h:532:44: note: parameter passing for argument of type ‘std::_Rb_tree, std::pair, long long unsigned int>, std::_Select1st, long long unsigned int> >, std::less >, std::allocator, long long unsigned int> > >::const_iterator’ changed in GCC 7.1 2025-09-04T16:34:04,749 532 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct, 2025-09-04T16:34:04,750 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:04,750 533 | std::forward_as_tuple(std::move(__k)), 2025-09-04T16:34:04,750 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:04,750 534 | std::tuple<>()); 2025-09-04T16:34:04,750 | ~~~~~~~~~~~~~~~ 2025-09-04T16:34:05,098 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/EPP.o networkit/cpp/community/EPP.cpp 2025-09-04T16:34:05,180 networkit/cpp/community/EPPFactory.cpp: In function ‘NetworKit::EPP NetworKit::EPPFactory::make(const NetworKit::Graph&, NetworKit::count, std::string, std::string)’: 2025-09-04T16:34:05,181 networkit/cpp/community/EPPFactory.cpp:44:33: warning: moving a local object in a return statement prevents copy elision [-Wpessimizing-move] 2025-09-04T16:34:05,181 44 | return std::move(ensemble); 2025-09-04T16:34:05,181 | ~~~~~~~~~^~~~~~~~~~ 2025-09-04T16:34:05,182 networkit/cpp/community/EPPFactory.cpp:44:33: note: remove ‘std::move’ call 2025-09-04T16:34:06,570 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/IndependentSetFinder.o networkit/cpp/independentset/IndependentSetFinder.cpp 2025-09-04T16:34:06,721 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/Luby.o networkit/cpp/independentset/Luby.cpp 2025-09-04T16:34:08,385 In file included from /usr/include/c++/14/set:62, 2025-09-04T16:34:08,385 from networkit/cpp/community/../structures/Partition.h:12, 2025-09-04T16:34:08,385 from networkit/cpp/community/CommunityDetectionAlgorithm.h:11, 2025-09-04T16:34:08,386 from networkit/cpp/community/CutClustering.h:4, 2025-09-04T16:34:08,386 from networkit/cpp/community/CutClustering.cpp:5: 2025-09-04T16:34:08,386 /usr/include/c++/14/bits/stl_tree.h: In function ‘std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_emplace_hint_unique(const_iterator, _Args&& ...) [with _Args = {const std::piecewise_construct_t&, std::tuple, std::tuple<>}; _Key = long long unsigned int; _Val = std::pair; _KeyOfValue = std::_Select1st >; _Compare = std::less; _Alloc = std::allocator >]’: 2025-09-04T16:34:08,387 /usr/include/c++/14/bits/stl_tree.h:2456:7: note: parameter passing for argument of type ‘std::_Rb_tree, std::_Select1st >, std::less, std::allocator > >::const_iterator’ changed in GCC 7.1 2025-09-04T16:34:08,387 2456 | _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>:: 2025-09-04T16:34:08,387 | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:08,536 /usr/include/c++/14/bits/stl_tree.h: In function ‘std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_emplace_hint_unique(const_iterator, _Args&& ...) [with _Args = {const std::piecewise_construct_t&, std::tuple, std::tuple<>}; _Key = long long unsigned int; _Val = std::pair; _KeyOfValue = std::_Select1st >; _Compare = std::less; _Alloc = std::allocator >]’: 2025-09-04T16:34:08,537 /usr/include/c++/14/bits/stl_tree.h:2456:7: note: parameter passing for argument of type ‘std::_Rb_tree, std::_Select1st >, std::less, std::allocator > >::const_iterator’ changed in GCC 7.1 2025-09-04T16:34:11,610 In file included from /usr/include/c++/14/map:63, 2025-09-04T16:34:11,610 from networkit/cpp/community/../structures/Partition.h:14: 2025-09-04T16:34:11,611 In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = long long unsigned int; _Tp = double; _Compare = std::less; _Alloc = std::allocator >]’, 2025-09-04T16:34:11,611 inlined from ‘NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::’ at networkit/cpp/community/CutClustering.cpp:151:30, 2025-09-04T16:34:11,611 inlined from ‘decltype (f(u, v, ew)) NetworKit::Graph::edgeLambda(F&, NetworKit::node, NetworKit::node, NetworKit::edgeweight, NetworKit::edgeid) const [with F = NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::; bool InEdges = false; typename std::enable_if<((Aux::FunctionTraits::arity >= 2) && std::is_same::arg<2>::type>::value)>::type* = 0]’ at networkit/cpp/community/../structures/../graph/Graph.h:247:11, 2025-09-04T16:34:11,611 inlined from ‘void NetworKit::Graph::forOutEdgesOfImpl(NetworKit::node, L) const [with bool graphIsDirected = false; bool hasWeights = false; bool graphHasEdgeIds = false; L = NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::]’ at networkit/cpp/community/../structures/../graph/Graph.h:1052:24, 2025-09-04T16:34:11,611 inlined from ‘void NetworKit::Graph::forEdgeImpl(L) const [with bool graphIsDirected = false; bool hasWeights = false; bool graphHasEdgeIds = false; L = NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::]’ at networkit/cpp/community/../structures/../graph/Graph.h:1081:69, 2025-09-04T16:34:11,611 inlined from ‘void NetworKit::Graph::forEdges(L) const [with L = NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::]’ at networkit/cpp/community/../structures/../graph/Graph.h:1118:38, 2025-09-04T16:34:11,612 inlined from ‘static void NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)’ at networkit/cpp/community/CutClustering.cpp:149:13: 2025-09-04T16:34:11,612 /usr/include/c++/14/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree, std::_Select1st >, std::less, std::allocator > >::const_iterator’ changed in GCC 7.1 2025-09-04T16:34:11,612 513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct, 2025-09-04T16:34:11,612 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:11,613 514 | std::tuple(__k), 2025-09-04T16:34:11,613 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:11,613 515 | std::tuple<>()); 2025-09-04T16:34:11,613 | ~~~~~~~~~~~~~~~ 2025-09-04T16:34:11,614 In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = long long unsigned int; _Tp = double; _Compare = std::less; _Alloc = std::allocator >]’, 2025-09-04T16:34:11,615 inlined from ‘NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::’ at networkit/cpp/community/CutClustering.cpp:152:30, 2025-09-04T16:34:11,615 inlined from ‘decltype (f(u, v, ew)) NetworKit::Graph::edgeLambda(F&, NetworKit::node, NetworKit::node, NetworKit::edgeweight, NetworKit::edgeid) const [with F = NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::; bool InEdges = false; typename std::enable_if<((Aux::FunctionTraits::arity >= 2) && std::is_same::arg<2>::type>::value)>::type* = 0]’ at networkit/cpp/community/../structures/../graph/Graph.h:247:11, 2025-09-04T16:34:11,615 inlined from ‘void NetworKit::Graph::forOutEdgesOfImpl(NetworKit::node, L) const [with bool graphIsDirected = false; bool hasWeights = false; bool graphHasEdgeIds = false; L = NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::]’ at networkit/cpp/community/../structures/../graph/Graph.h:1052:24, 2025-09-04T16:34:11,615 inlined from ‘void NetworKit::Graph::forEdgeImpl(L) const [with bool graphIsDirected = false; bool hasWeights = false; bool graphHasEdgeIds = false; L = NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::]’ at networkit/cpp/community/../structures/../graph/Graph.h:1081:69, 2025-09-04T16:34:11,615 inlined from ‘void NetworKit::Graph::forEdges(L) const [with L = NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::]’ at networkit/cpp/community/../structures/../graph/Graph.h:1118:38, 2025-09-04T16:34:11,616 inlined from ‘static void NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)’ at networkit/cpp/community/CutClustering.cpp:149:13: 2025-09-04T16:34:11,616 /usr/include/c++/14/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree, std::_Select1st >, std::less, std::allocator > >::const_iterator’ changed in GCC 7.1 2025-09-04T16:34:11,616 513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct, 2025-09-04T16:34:11,616 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:11,617 514 | std::tuple(__k), 2025-09-04T16:34:11,617 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:11,617 515 | std::tuple<>()); 2025-09-04T16:34:11,617 | ~~~~~~~~~~~~~~~ 2025-09-04T16:34:11,619 In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = long long unsigned int; _Tp = double; _Compare = std::less; _Alloc = std::allocator >]’, 2025-09-04T16:34:11,619 inlined from ‘NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::’ at networkit/cpp/community/CutClustering.cpp:156:30, 2025-09-04T16:34:11,619 inlined from ‘decltype (f(u, v, ew)) NetworKit::Graph::edgeLambda(F&, NetworKit::node, NetworKit::node, NetworKit::edgeweight, NetworKit::edgeid) const [with F = NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::; bool InEdges = false; typename std::enable_if<((Aux::FunctionTraits::arity >= 2) && std::is_same::arg<2>::type>::value)>::type* = 0]’ at networkit/cpp/community/../structures/../graph/Graph.h:247:11, 2025-09-04T16:34:11,619 inlined from ‘void NetworKit::Graph::forOutEdgesOfImpl(NetworKit::node, L) const [with bool graphIsDirected = false; bool hasWeights = false; bool graphHasEdgeIds = false; L = NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::]’ at networkit/cpp/community/../structures/../graph/Graph.h:1052:24, 2025-09-04T16:34:11,620 inlined from ‘void NetworKit::Graph::forEdgeImpl(L) const [with bool graphIsDirected = false; bool hasWeights = false; bool graphHasEdgeIds = false; L = NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::]’ at networkit/cpp/community/../structures/../graph/Graph.h:1081:69, 2025-09-04T16:34:11,620 inlined from ‘void NetworKit::Graph::forEdges(L) const [with L = NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::]’ at networkit/cpp/community/../structures/../graph/Graph.h:1118:38, 2025-09-04T16:34:11,620 inlined from ‘static void NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)’ at networkit/cpp/community/CutClustering.cpp:149:13: 2025-09-04T16:34:11,620 /usr/include/c++/14/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree, std::_Select1st >, std::less, std::allocator > >::const_iterator’ changed in GCC 7.1 2025-09-04T16:34:11,620 513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct, 2025-09-04T16:34:11,621 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:11,621 514 | std::tuple(__k), 2025-09-04T16:34:11,621 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:11,621 515 | std::tuple<>()); 2025-09-04T16:34:11,621 | ~~~~~~~~~~~~~~~ 2025-09-04T16:34:11,632 In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = long long unsigned int; _Tp = double; _Compare = std::less; _Alloc = std::allocator >]’, 2025-09-04T16:34:11,632 inlined from ‘NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::’ at networkit/cpp/community/CutClustering.cpp:157:30, 2025-09-04T16:34:11,632 inlined from ‘decltype (f(u, v, ew)) NetworKit::Graph::edgeLambda(F&, NetworKit::node, NetworKit::node, NetworKit::edgeweight, NetworKit::edgeid) const [with F = NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::; bool InEdges = false; typename std::enable_if<((Aux::FunctionTraits::arity >= 2) && std::is_same::arg<2>::type>::value)>::type* = 0]’ at networkit/cpp/community/../structures/../graph/Graph.h:247:11, 2025-09-04T16:34:11,633 inlined from ‘void NetworKit::Graph::forOutEdgesOfImpl(NetworKit::node, L) const [with bool graphIsDirected = false; bool hasWeights = false; bool graphHasEdgeIds = false; L = NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::]’ at networkit/cpp/community/../structures/../graph/Graph.h:1052:24, 2025-09-04T16:34:11,633 inlined from ‘void NetworKit::Graph::forEdgeImpl(L) const [with bool graphIsDirected = false; bool hasWeights = false; bool graphHasEdgeIds = false; L = NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::]’ at networkit/cpp/community/../structures/../graph/Graph.h:1081:69, 2025-09-04T16:34:11,633 inlined from ‘void NetworKit::Graph::forEdges(L) const [with L = NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::]’ at networkit/cpp/community/../structures/../graph/Graph.h:1118:38, 2025-09-04T16:34:11,633 inlined from ‘static void NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)’ at networkit/cpp/community/CutClustering.cpp:149:13: 2025-09-04T16:34:11,634 /usr/include/c++/14/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree, std::_Select1st >, std::less, std::allocator > >::const_iterator’ changed in GCC 7.1 2025-09-04T16:34:11,634 513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct, 2025-09-04T16:34:11,634 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:11,634 514 | std::tuple(__k), 2025-09-04T16:34:11,634 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:11,634 515 | std::tuple<>()); 2025-09-04T16:34:11,634 | ~~~~~~~~~~~~~~~ 2025-09-04T16:34:11,635 In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = long long unsigned int; _Tp = double; _Compare = std::less; _Alloc = std::allocator >]’, 2025-09-04T16:34:11,635 inlined from ‘NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::’ at networkit/cpp/community/CutClustering.cpp:151:30, 2025-09-04T16:34:11,635 inlined from ‘decltype (f(u, v, ew)) NetworKit::Graph::edgeLambda(F&, NetworKit::node, NetworKit::node, NetworKit::edgeweight, NetworKit::edgeid) const [with F = NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::; bool InEdges = false; typename std::enable_if<((Aux::FunctionTraits::arity >= 2) && std::is_same::arg<2>::type>::value)>::type* = 0]’ at networkit/cpp/community/../structures/../graph/Graph.h:247:11, 2025-09-04T16:34:11,635 inlined from ‘void NetworKit::Graph::forOutEdgesOfImpl(NetworKit::node, L) const [with bool graphIsDirected = false; bool hasWeights = true; bool graphHasEdgeIds = false; L = NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::]’ at networkit/cpp/community/../structures/../graph/Graph.h:1052:24, 2025-09-04T16:34:11,635 inlined from ‘void NetworKit::Graph::forEdgeImpl(L) const [with bool graphIsDirected = false; bool hasWeights = true; bool graphHasEdgeIds = false; L = NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::]’ at networkit/cpp/community/../structures/../graph/Graph.h:1081:69, 2025-09-04T16:34:11,636 inlined from ‘void NetworKit::Graph::forEdges(L) const [with L = NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::]’ at networkit/cpp/community/../structures/../graph/Graph.h:1122:37, 2025-09-04T16:34:11,636 inlined from ‘static void NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)’ at networkit/cpp/community/CutClustering.cpp:149:13: 2025-09-04T16:34:11,636 /usr/include/c++/14/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree, std::_Select1st >, std::less, std::allocator > >::const_iterator’ changed in GCC 7.1 2025-09-04T16:34:11,636 513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct, 2025-09-04T16:34:11,636 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:11,636 514 | std::tuple(__k), 2025-09-04T16:34:11,637 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:11,637 515 | std::tuple<>()); 2025-09-04T16:34:11,637 | ~~~~~~~~~~~~~~~ 2025-09-04T16:34:11,637 In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = long long unsigned int; _Tp = double; _Compare = std::less; _Alloc = std::allocator >]’, 2025-09-04T16:34:11,637 inlined from ‘NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::’ at networkit/cpp/community/CutClustering.cpp:152:30, 2025-09-04T16:34:11,638 inlined from ‘decltype (f(u, v, ew)) NetworKit::Graph::edgeLambda(F&, NetworKit::node, NetworKit::node, NetworKit::edgeweight, NetworKit::edgeid) const [with F = NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::; bool InEdges = false; typename std::enable_if<((Aux::FunctionTraits::arity >= 2) && std::is_same::arg<2>::type>::value)>::type* = 0]’ at networkit/cpp/community/../structures/../graph/Graph.h:247:11, 2025-09-04T16:34:11,638 inlined from ‘void NetworKit::Graph::forOutEdgesOfImpl(NetworKit::node, L) const [with bool graphIsDirected = false; bool hasWeights = true; bool graphHasEdgeIds = false; L = NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::]’ at networkit/cpp/community/../structures/../graph/Graph.h:1052:24, 2025-09-04T16:34:11,638 inlined from ‘void NetworKit::Graph::forEdgeImpl(L) const [with bool graphIsDirected = false; bool hasWeights = true; bool graphHasEdgeIds = false; L = NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::]’ at networkit/cpp/community/../structures/../graph/Graph.h:1081:69, 2025-09-04T16:34:11,638 inlined from ‘void NetworKit::Graph::forEdges(L) const [with L = NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::]’ at networkit/cpp/community/../structures/../graph/Graph.h:1122:37, 2025-09-04T16:34:11,639 inlined from ‘static void NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)’ at networkit/cpp/community/CutClustering.cpp:149:13: 2025-09-04T16:34:11,639 /usr/include/c++/14/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree, std::_Select1st >, std::less, std::allocator > >::const_iterator’ changed in GCC 7.1 2025-09-04T16:34:11,639 513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct, 2025-09-04T16:34:11,639 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:11,639 514 | std::tuple(__k), 2025-09-04T16:34:11,639 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:11,640 515 | std::tuple<>()); 2025-09-04T16:34:11,640 | ~~~~~~~~~~~~~~~ 2025-09-04T16:34:11,640 In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = long long unsigned int; _Tp = double; _Compare = std::less; _Alloc = std::allocator >]’, 2025-09-04T16:34:11,640 inlined from ‘NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::’ at networkit/cpp/community/CutClustering.cpp:156:30, 2025-09-04T16:34:11,640 inlined from ‘decltype (f(u, v, ew)) NetworKit::Graph::edgeLambda(F&, NetworKit::node, NetworKit::node, NetworKit::edgeweight, NetworKit::edgeid) const [with F = NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::; bool InEdges = false; typename std::enable_if<((Aux::FunctionTraits::arity >= 2) && std::is_same::arg<2>::type>::value)>::type* = 0]’ at networkit/cpp/community/../structures/../graph/Graph.h:247:11, 2025-09-04T16:34:11,641 inlined from ‘void NetworKit::Graph::forOutEdgesOfImpl(NetworKit::node, L) const [with bool graphIsDirected = false; bool hasWeights = true; bool graphHasEdgeIds = false; L = NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::]’ at networkit/cpp/community/../structures/../graph/Graph.h:1052:24, 2025-09-04T16:34:11,641 inlined from ‘void NetworKit::Graph::forEdgeImpl(L) const [with bool graphIsDirected = false; bool hasWeights = true; bool graphHasEdgeIds = false; L = NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::]’ at networkit/cpp/community/../structures/../graph/Graph.h:1081:69, 2025-09-04T16:34:11,641 inlined from ‘void NetworKit::Graph::forEdges(L) const [with L = NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::]’ at networkit/cpp/community/../structures/../graph/Graph.h:1122:37, 2025-09-04T16:34:11,641 inlined from ‘static void NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)’ at networkit/cpp/community/CutClustering.cpp:149:13: 2025-09-04T16:34:11,642 /usr/include/c++/14/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree, std::_Select1st >, std::less, std::allocator > >::const_iterator’ changed in GCC 7.1 2025-09-04T16:34:11,642 513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct, 2025-09-04T16:34:11,642 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:11,642 514 | std::tuple(__k), 2025-09-04T16:34:11,642 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:11,642 515 | std::tuple<>()); 2025-09-04T16:34:11,642 | ~~~~~~~~~~~~~~~ 2025-09-04T16:34:11,643 In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = long long unsigned int; _Tp = double; _Compare = std::less; _Alloc = std::allocator >]’, 2025-09-04T16:34:11,643 inlined from ‘NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::’ at networkit/cpp/community/CutClustering.cpp:157:30, 2025-09-04T16:34:11,643 inlined from ‘decltype (f(u, v, ew)) NetworKit::Graph::edgeLambda(F&, NetworKit::node, NetworKit::node, NetworKit::edgeweight, NetworKit::edgeid) const [with F = NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::; bool InEdges = false; typename std::enable_if<((Aux::FunctionTraits::arity >= 2) && std::is_same::arg<2>::type>::value)>::type* = 0]’ at networkit/cpp/community/../structures/../graph/Graph.h:247:11, 2025-09-04T16:34:11,643 inlined from ‘void NetworKit::Graph::forOutEdgesOfImpl(NetworKit::node, L) const [with bool graphIsDirected = false; bool hasWeights = true; bool graphHasEdgeIds = false; L = NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::]’ at networkit/cpp/community/../structures/../graph/Graph.h:1052:24, 2025-09-04T16:34:11,644 inlined from ‘void NetworKit::Graph::forEdgeImpl(L) const [with bool graphIsDirected = false; bool hasWeights = true; bool graphHasEdgeIds = false; L = NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::]’ at networkit/cpp/community/../structures/../graph/Graph.h:1081:69, 2025-09-04T16:34:11,644 inlined from ‘void NetworKit::Graph::forEdges(L) const [with L = NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::]’ at networkit/cpp/community/../structures/../graph/Graph.h:1122:37, 2025-09-04T16:34:11,644 inlined from ‘static void NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)’ at networkit/cpp/community/CutClustering.cpp:149:13: 2025-09-04T16:34:11,644 /usr/include/c++/14/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree, std::_Select1st >, std::less, std::allocator > >::const_iterator’ changed in GCC 7.1 2025-09-04T16:34:11,644 513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct, 2025-09-04T16:34:11,644 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:11,645 514 | std::tuple(__k), 2025-09-04T16:34:11,645 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:11,645 515 | std::tuple<>()); 2025-09-04T16:34:11,645 | ~~~~~~~~~~~~~~~ 2025-09-04T16:34:11,645 In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = long long unsigned int; _Tp = double; _Compare = std::less; _Alloc = std::allocator >]’, 2025-09-04T16:34:11,645 inlined from ‘NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::’ at networkit/cpp/community/CutClustering.cpp:151:30, 2025-09-04T16:34:11,645 inlined from ‘decltype (f(u, v, ew)) NetworKit::Graph::edgeLambda(F&, NetworKit::node, NetworKit::node, NetworKit::edgeweight, NetworKit::edgeid) const [with F = NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::; bool InEdges = false; typename std::enable_if<((Aux::FunctionTraits::arity >= 2) && std::is_same::arg<2>::type>::value)>::type* = 0]’ at networkit/cpp/community/../structures/../graph/Graph.h:247:11, 2025-09-04T16:34:11,646 inlined from ‘void NetworKit::Graph::forOutEdgesOfImpl(NetworKit::node, L) const [with bool graphIsDirected = true; bool hasWeights = false; bool graphHasEdgeIds = false; L = NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::]’ at networkit/cpp/community/../structures/../graph/Graph.h:1052:24, 2025-09-04T16:34:11,646 inlined from ‘void NetworKit::Graph::forEdgeImpl(L) const [with bool graphIsDirected = true; bool hasWeights = false; bool graphHasEdgeIds = false; L = NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::]’ at networkit/cpp/community/../structures/../graph/Graph.h:1081:69, 2025-09-04T16:34:11,646 inlined from ‘void NetworKit::Graph::forEdges(L) const [with L = NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::]’ at networkit/cpp/community/../structures/../graph/Graph.h:1126:37, 2025-09-04T16:34:11,646 inlined from ‘static void NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)’ at networkit/cpp/community/CutClustering.cpp:149:13: 2025-09-04T16:34:11,646 /usr/include/c++/14/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree, std::_Select1st >, std::less, std::allocator > >::const_iterator’ changed in GCC 7.1 2025-09-04T16:34:11,646 513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct, 2025-09-04T16:34:11,647 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:11,647 514 | std::tuple(__k), 2025-09-04T16:34:11,647 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:11,647 515 | std::tuple<>()); 2025-09-04T16:34:11,647 | ~~~~~~~~~~~~~~~ 2025-09-04T16:34:11,647 In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = long long unsigned int; _Tp = double; _Compare = std::less; _Alloc = std::allocator >]’, 2025-09-04T16:34:11,647 inlined from ‘NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::’ at networkit/cpp/community/CutClustering.cpp:152:30, 2025-09-04T16:34:11,648 inlined from ‘decltype (f(u, v, ew)) NetworKit::Graph::edgeLambda(F&, NetworKit::node, NetworKit::node, NetworKit::edgeweight, NetworKit::edgeid) const [with F = NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::; bool InEdges = false; typename std::enable_if<((Aux::FunctionTraits::arity >= 2) && std::is_same::arg<2>::type>::value)>::type* = 0]’ at networkit/cpp/community/../structures/../graph/Graph.h:247:11, 2025-09-04T16:34:11,648 inlined from ‘void NetworKit::Graph::forOutEdgesOfImpl(NetworKit::node, L) const [with bool graphIsDirected = true; bool hasWeights = false; bool graphHasEdgeIds = false; L = NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::]’ at networkit/cpp/community/../structures/../graph/Graph.h:1052:24, 2025-09-04T16:34:11,648 inlined from ‘void NetworKit::Graph::forEdgeImpl(L) const [with bool graphIsDirected = true; bool hasWeights = false; bool graphHasEdgeIds = false; L = NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::]’ at networkit/cpp/community/../structures/../graph/Graph.h:1081:69, 2025-09-04T16:34:11,648 inlined from ‘void NetworKit::Graph::forEdges(L) const [with L = NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::]’ at networkit/cpp/community/../structures/../graph/Graph.h:1126:37, 2025-09-04T16:34:11,648 inlined from ‘static void NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)’ at networkit/cpp/community/CutClustering.cpp:149:13: 2025-09-04T16:34:11,649 /usr/include/c++/14/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree, std::_Select1st >, std::less, std::allocator > >::const_iterator’ changed in GCC 7.1 2025-09-04T16:34:11,649 513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct, 2025-09-04T16:34:11,649 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:11,649 514 | std::tuple(__k), 2025-09-04T16:34:11,649 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:11,649 515 | std::tuple<>()); 2025-09-04T16:34:11,650 | ~~~~~~~~~~~~~~~ 2025-09-04T16:34:11,650 In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = long long unsigned int; _Tp = double; _Compare = std::less; _Alloc = std::allocator >]’, 2025-09-04T16:34:11,650 inlined from ‘NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::’ at networkit/cpp/community/CutClustering.cpp:156:30, 2025-09-04T16:34:11,650 inlined from ‘decltype (f(u, v, ew)) NetworKit::Graph::edgeLambda(F&, NetworKit::node, NetworKit::node, NetworKit::edgeweight, NetworKit::edgeid) const [with F = NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::; bool InEdges = false; typename std::enable_if<((Aux::FunctionTraits::arity >= 2) && std::is_same::arg<2>::type>::value)>::type* = 0]’ at networkit/cpp/community/../structures/../graph/Graph.h:247:11, 2025-09-04T16:34:11,650 inlined from ‘void NetworKit::Graph::forOutEdgesOfImpl(NetworKit::node, L) const [with bool graphIsDirected = true; bool hasWeights = false; bool graphHasEdgeIds = false; L = NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::]’ at networkit/cpp/community/../structures/../graph/Graph.h:1052:24, 2025-09-04T16:34:11,651 inlined from ‘void NetworKit::Graph::forEdgeImpl(L) const [with bool graphIsDirected = true; bool hasWeights = false; bool graphHasEdgeIds = false; L = NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::]’ at networkit/cpp/community/../structures/../graph/Graph.h:1081:69, 2025-09-04T16:34:11,651 inlined from ‘void NetworKit::Graph::forEdges(L) const [with L = NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::]’ at networkit/cpp/community/../structures/../graph/Graph.h:1126:37, 2025-09-04T16:34:11,651 inlined from ‘static void NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)’ at networkit/cpp/community/CutClustering.cpp:149:13: 2025-09-04T16:34:11,651 /usr/include/c++/14/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree, std::_Select1st >, std::less, std::allocator > >::const_iterator’ changed in GCC 7.1 2025-09-04T16:34:11,661 513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct, 2025-09-04T16:34:11,662 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:11,662 514 | std::tuple(__k), 2025-09-04T16:34:11,662 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:11,662 515 | std::tuple<>()); 2025-09-04T16:34:11,662 | ~~~~~~~~~~~~~~~ 2025-09-04T16:34:11,663 In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = long long unsigned int; _Tp = double; _Compare = std::less; _Alloc = std::allocator >]’, 2025-09-04T16:34:11,663 inlined from ‘NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::’ at networkit/cpp/community/CutClustering.cpp:157:30, 2025-09-04T16:34:11,663 inlined from ‘decltype (f(u, v, ew)) NetworKit::Graph::edgeLambda(F&, NetworKit::node, NetworKit::node, NetworKit::edgeweight, NetworKit::edgeid) const [with F = NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::; bool InEdges = false; typename std::enable_if<((Aux::FunctionTraits::arity >= 2) && std::is_same::arg<2>::type>::value)>::type* = 0]’ at networkit/cpp/community/../structures/../graph/Graph.h:247:11, 2025-09-04T16:34:11,663 inlined from ‘void NetworKit::Graph::forOutEdgesOfImpl(NetworKit::node, L) const [with bool graphIsDirected = true; bool hasWeights = false; bool graphHasEdgeIds = false; L = NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::]’ at networkit/cpp/community/../structures/../graph/Graph.h:1052:24, 2025-09-04T16:34:11,663 inlined from ‘void NetworKit::Graph::forEdgeImpl(L) const [with bool graphIsDirected = true; bool hasWeights = false; bool graphHasEdgeIds = false; L = NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::]’ at networkit/cpp/community/../structures/../graph/Graph.h:1081:69, 2025-09-04T16:34:11,663 inlined from ‘void NetworKit::Graph::forEdges(L) const [with L = NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::]’ at networkit/cpp/community/../structures/../graph/Graph.h:1126:37, 2025-09-04T16:34:11,664 inlined from ‘static void NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)’ at networkit/cpp/community/CutClustering.cpp:149:13: 2025-09-04T16:34:11,664 /usr/include/c++/14/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree, std::_Select1st >, std::less, std::allocator > >::const_iterator’ changed in GCC 7.1 2025-09-04T16:34:11,664 513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct, 2025-09-04T16:34:11,664 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:11,664 514 | std::tuple(__k), 2025-09-04T16:34:11,664 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:11,664 515 | std::tuple<>()); 2025-09-04T16:34:11,665 | ~~~~~~~~~~~~~~~ 2025-09-04T16:34:11,665 In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = long long unsigned int; _Tp = double; _Compare = std::less; _Alloc = std::allocator >]’, 2025-09-04T16:34:11,665 inlined from ‘NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::’ at networkit/cpp/community/CutClustering.cpp:151:30, 2025-09-04T16:34:11,665 inlined from ‘decltype (f(u, v, ew)) NetworKit::Graph::edgeLambda(F&, NetworKit::node, NetworKit::node, NetworKit::edgeweight, NetworKit::edgeid) const [with F = NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::; bool InEdges = false; typename std::enable_if<((Aux::FunctionTraits::arity >= 2) && std::is_same::arg<2>::type>::value)>::type* = 0]’ at networkit/cpp/community/../structures/../graph/Graph.h:247:11, 2025-09-04T16:34:11,665 inlined from ‘void NetworKit::Graph::forOutEdgesOfImpl(NetworKit::node, L) const [with bool graphIsDirected = true; bool hasWeights = true; bool graphHasEdgeIds = false; L = NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::]’ at networkit/cpp/community/../structures/../graph/Graph.h:1052:24, 2025-09-04T16:34:11,665 inlined from ‘void NetworKit::Graph::forEdgeImpl(L) const [with bool graphIsDirected = true; bool hasWeights = true; bool graphHasEdgeIds = false; L = NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::]’ at networkit/cpp/community/../structures/../graph/Graph.h:1081:69, 2025-09-04T16:34:11,665 inlined from ‘void NetworKit::Graph::forEdges(L) const [with L = NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::]’ at networkit/cpp/community/../structures/../graph/Graph.h:1130:36, 2025-09-04T16:34:11,666 inlined from ‘static void NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)’ at networkit/cpp/community/CutClustering.cpp:149:13: 2025-09-04T16:34:11,666 /usr/include/c++/14/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree, std::_Select1st >, std::less, std::allocator > >::const_iterator’ changed in GCC 7.1 2025-09-04T16:34:11,666 513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct, 2025-09-04T16:34:11,666 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:11,666 514 | std::tuple(__k), 2025-09-04T16:34:11,667 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:11,667 515 | std::tuple<>()); 2025-09-04T16:34:11,667 | ~~~~~~~~~~~~~~~ 2025-09-04T16:34:11,667 In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = long long unsigned int; _Tp = double; _Compare = std::less; _Alloc = std::allocator >]’, 2025-09-04T16:34:11,667 inlined from ‘NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::’ at networkit/cpp/community/CutClustering.cpp:152:30, 2025-09-04T16:34:11,667 inlined from ‘decltype (f(u, v, ew)) NetworKit::Graph::edgeLambda(F&, NetworKit::node, NetworKit::node, NetworKit::edgeweight, NetworKit::edgeid) const [with F = NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::; bool InEdges = false; typename std::enable_if<((Aux::FunctionTraits::arity >= 2) && std::is_same::arg<2>::type>::value)>::type* = 0]’ at networkit/cpp/community/../structures/../graph/Graph.h:247:11, 2025-09-04T16:34:11,668 inlined from ‘void NetworKit::Graph::forOutEdgesOfImpl(NetworKit::node, L) const [with bool graphIsDirected = true; bool hasWeights = true; bool graphHasEdgeIds = false; L = NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::]’ at networkit/cpp/community/../structures/../graph/Graph.h:1052:24, 2025-09-04T16:34:11,668 inlined from ‘void NetworKit::Graph::forEdgeImpl(L) const [with bool graphIsDirected = true; bool hasWeights = true; bool graphHasEdgeIds = false; L = NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::]’ at networkit/cpp/community/../structures/../graph/Graph.h:1081:69, 2025-09-04T16:34:11,668 inlined from ‘void NetworKit::Graph::forEdges(L) const [with L = NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::]’ at networkit/cpp/community/../structures/../graph/Graph.h:1130:36, 2025-09-04T16:34:11,668 inlined from ‘static void NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)’ at networkit/cpp/community/CutClustering.cpp:149:13: 2025-09-04T16:34:11,668 /usr/include/c++/14/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree, std::_Select1st >, std::less, std::allocator > >::const_iterator’ changed in GCC 7.1 2025-09-04T16:34:11,668 513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct, 2025-09-04T16:34:11,669 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:11,669 514 | std::tuple(__k), 2025-09-04T16:34:11,669 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:11,669 515 | std::tuple<>()); 2025-09-04T16:34:11,669 | ~~~~~~~~~~~~~~~ 2025-09-04T16:34:11,669 In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = long long unsigned int; _Tp = double; _Compare = std::less; _Alloc = std::allocator >]’, 2025-09-04T16:34:11,669 inlined from ‘NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::’ at networkit/cpp/community/CutClustering.cpp:156:30, 2025-09-04T16:34:11,670 inlined from ‘decltype (f(u, v, ew)) NetworKit::Graph::edgeLambda(F&, NetworKit::node, NetworKit::node, NetworKit::edgeweight, NetworKit::edgeid) const [with F = NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::; bool InEdges = false; typename std::enable_if<((Aux::FunctionTraits::arity >= 2) && std::is_same::arg<2>::type>::value)>::type* = 0]’ at networkit/cpp/community/../structures/../graph/Graph.h:247:11, 2025-09-04T16:34:11,670 inlined from ‘void NetworKit::Graph::forOutEdgesOfImpl(NetworKit::node, L) const [with bool graphIsDirected = true; bool hasWeights = true; bool graphHasEdgeIds = false; L = NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::]’ at networkit/cpp/community/../structures/../graph/Graph.h:1052:24, 2025-09-04T16:34:11,670 inlined from ‘void NetworKit::Graph::forEdgeImpl(L) const [with bool graphIsDirected = true; bool hasWeights = true; bool graphHasEdgeIds = false; L = NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::]’ at networkit/cpp/community/../structures/../graph/Graph.h:1081:69, 2025-09-04T16:34:11,670 inlined from ‘void NetworKit::Graph::forEdges(L) const [with L = NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::]’ at networkit/cpp/community/../structures/../graph/Graph.h:1130:36, 2025-09-04T16:34:11,670 inlined from ‘static void NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)’ at networkit/cpp/community/CutClustering.cpp:149:13: 2025-09-04T16:34:11,670 /usr/include/c++/14/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree, std::_Select1st >, std::less, std::allocator > >::const_iterator’ changed in GCC 7.1 2025-09-04T16:34:11,671 513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct, 2025-09-04T16:34:11,671 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:11,671 514 | std::tuple(__k), 2025-09-04T16:34:11,671 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:11,671 515 | std::tuple<>()); 2025-09-04T16:34:11,679 | ~~~~~~~~~~~~~~~ 2025-09-04T16:34:11,679 In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = long long unsigned int; _Tp = double; _Compare = std::less; _Alloc = std::allocator >]’, 2025-09-04T16:34:11,679 inlined from ‘NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::’ at networkit/cpp/community/CutClustering.cpp:157:30, 2025-09-04T16:34:11,679 inlined from ‘decltype (f(u, v, ew)) NetworKit::Graph::edgeLambda(F&, NetworKit::node, NetworKit::node, NetworKit::edgeweight, NetworKit::edgeid) const [with F = NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::; bool InEdges = false; typename std::enable_if<((Aux::FunctionTraits::arity >= 2) && std::is_same::arg<2>::type>::value)>::type* = 0]’ at networkit/cpp/community/../structures/../graph/Graph.h:247:11, 2025-09-04T16:34:11,680 inlined from ‘void NetworKit::Graph::forOutEdgesOfImpl(NetworKit::node, L) const [with bool graphIsDirected = true; bool hasWeights = true; bool graphHasEdgeIds = false; L = NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::]’ at networkit/cpp/community/../structures/../graph/Graph.h:1052:24, 2025-09-04T16:34:11,680 inlined from ‘void NetworKit::Graph::forEdgeImpl(L) const [with bool graphIsDirected = true; bool hasWeights = true; bool graphHasEdgeIds = false; L = NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::]’ at networkit/cpp/community/../structures/../graph/Graph.h:1081:69, 2025-09-04T16:34:11,680 inlined from ‘void NetworKit::Graph::forEdges(L) const [with L = NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::]’ at networkit/cpp/community/../structures/../graph/Graph.h:1130:36, 2025-09-04T16:34:11,680 inlined from ‘static void NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)’ at networkit/cpp/community/CutClustering.cpp:149:13: 2025-09-04T16:34:11,681 /usr/include/c++/14/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree, std::_Select1st >, std::less, std::allocator > >::const_iterator’ changed in GCC 7.1 2025-09-04T16:34:11,681 513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct, 2025-09-04T16:34:11,681 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:11,681 514 | std::tuple(__k), 2025-09-04T16:34:11,681 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:11,682 515 | std::tuple<>()); 2025-09-04T16:34:11,682 | ~~~~~~~~~~~~~~~ 2025-09-04T16:34:11,682 In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = long long unsigned int; _Tp = double; _Compare = std::less; _Alloc = std::allocator >]’, 2025-09-04T16:34:11,682 inlined from ‘NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::’ at networkit/cpp/community/CutClustering.cpp:151:30, 2025-09-04T16:34:11,682 inlined from ‘decltype (f(u, v, ew)) NetworKit::Graph::edgeLambda(F&, NetworKit::node, NetworKit::node, NetworKit::edgeweight, NetworKit::edgeid) const [with F = NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::; bool InEdges = false; typename std::enable_if<((Aux::FunctionTraits::arity >= 2) && std::is_same::arg<2>::type>::value)>::type* = 0]’ at networkit/cpp/community/../structures/../graph/Graph.h:247:11, 2025-09-04T16:34:11,683 inlined from ‘void NetworKit::Graph::forOutEdgesOfImpl(NetworKit::node, L) const [with bool graphIsDirected = false; bool hasWeights = false; bool graphHasEdgeIds = false; L = NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::]’ at networkit/cpp/community/../structures/../graph/Graph.h:1052:24, 2025-09-04T16:34:11,683 inlined from ‘void NetworKit::Graph::forEdgeImpl(L) const [with bool graphIsDirected = false; bool hasWeights = false; bool graphHasEdgeIds = true; L = NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::]’ at networkit/cpp/community/../structures/../graph/Graph.h:1081:69, 2025-09-04T16:34:11,683 inlined from ‘void NetworKit::Graph::forEdges(L) const [with L = NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::]’ at networkit/cpp/community/../structures/../graph/Graph.h:1134:37, 2025-09-04T16:34:11,683 inlined from ‘static void NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)’ at networkit/cpp/community/CutClustering.cpp:149:13: 2025-09-04T16:34:11,684 /usr/include/c++/14/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree, std::_Select1st >, std::less, std::allocator > >::const_iterator’ changed in GCC 7.1 2025-09-04T16:34:11,684 513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct, 2025-09-04T16:34:11,684 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:11,684 514 | std::tuple(__k), 2025-09-04T16:34:11,685 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:11,685 515 | std::tuple<>()); 2025-09-04T16:34:11,685 | ~~~~~~~~~~~~~~~ 2025-09-04T16:34:11,685 In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = long long unsigned int; _Tp = double; _Compare = std::less; _Alloc = std::allocator >]’, 2025-09-04T16:34:11,685 inlined from ‘NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::’ at networkit/cpp/community/CutClustering.cpp:152:30, 2025-09-04T16:34:11,686 inlined from ‘decltype (f(u, v, ew)) NetworKit::Graph::edgeLambda(F&, NetworKit::node, NetworKit::node, NetworKit::edgeweight, NetworKit::edgeid) const [with F = NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::; bool InEdges = false; typename std::enable_if<((Aux::FunctionTraits::arity >= 2) && std::is_same::arg<2>::type>::value)>::type* = 0]’ at networkit/cpp/community/../structures/../graph/Graph.h:247:11, 2025-09-04T16:34:11,686 inlined from ‘void NetworKit::Graph::forOutEdgesOfImpl(NetworKit::node, L) const [with bool graphIsDirected = false; bool hasWeights = false; bool graphHasEdgeIds = false; L = NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::]’ at networkit/cpp/community/../structures/../graph/Graph.h:1052:24, 2025-09-04T16:34:11,686 inlined from ‘void NetworKit::Graph::forEdgeImpl(L) const [with bool graphIsDirected = false; bool hasWeights = false; bool graphHasEdgeIds = true; L = NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::]’ at networkit/cpp/community/../structures/../graph/Graph.h:1081:69, 2025-09-04T16:34:11,686 inlined from ‘void NetworKit::Graph::forEdges(L) const [with L = NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::]’ at networkit/cpp/community/../structures/../graph/Graph.h:1134:37, 2025-09-04T16:34:11,687 inlined from ‘static void NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)’ at networkit/cpp/community/CutClustering.cpp:149:13: 2025-09-04T16:34:11,687 /usr/include/c++/14/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree, std::_Select1st >, std::less, std::allocator > >::const_iterator’ changed in GCC 7.1 2025-09-04T16:34:11,687 513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct, 2025-09-04T16:34:11,687 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:11,687 514 | std::tuple(__k), 2025-09-04T16:34:11,687 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:11,687 515 | std::tuple<>()); 2025-09-04T16:34:11,688 | ~~~~~~~~~~~~~~~ 2025-09-04T16:34:11,688 In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = long long unsigned int; _Tp = double; _Compare = std::less; _Alloc = std::allocator >]’, 2025-09-04T16:34:11,688 inlined from ‘NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::’ at networkit/cpp/community/CutClustering.cpp:156:30, 2025-09-04T16:34:11,688 inlined from ‘decltype (f(u, v, ew)) NetworKit::Graph::edgeLambda(F&, NetworKit::node, NetworKit::node, NetworKit::edgeweight, NetworKit::edgeid) const [with F = NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::; bool InEdges = false; typename std::enable_if<((Aux::FunctionTraits::arity >= 2) && std::is_same::arg<2>::type>::value)>::type* = 0]’ at networkit/cpp/community/../structures/../graph/Graph.h:247:11, 2025-09-04T16:34:11,688 inlined from ‘void NetworKit::Graph::forOutEdgesOfImpl(NetworKit::node, L) const [with bool graphIsDirected = false; bool hasWeights = false; bool graphHasEdgeIds = false; L = NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::]’ at networkit/cpp/community/../structures/../graph/Graph.h:1052:24, 2025-09-04T16:34:11,688 inlined from ‘void NetworKit::Graph::forEdgeImpl(L) const [with bool graphIsDirected = false; bool hasWeights = false; bool graphHasEdgeIds = true; L = NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::]’ at networkit/cpp/community/../structures/../graph/Graph.h:1081:69, 2025-09-04T16:34:11,688 inlined from ‘void NetworKit::Graph::forEdges(L) const [with L = NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::]’ at networkit/cpp/community/../structures/../graph/Graph.h:1134:37, 2025-09-04T16:34:11,689 inlined from ‘static void NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)’ at networkit/cpp/community/CutClustering.cpp:149:13: 2025-09-04T16:34:11,689 /usr/include/c++/14/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree, std::_Select1st >, std::less, std::allocator > >::const_iterator’ changed in GCC 7.1 2025-09-04T16:34:11,689 513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct, 2025-09-04T16:34:11,689 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:11,689 514 | std::tuple(__k), 2025-09-04T16:34:11,689 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:11,690 515 | std::tuple<>()); 2025-09-04T16:34:11,690 | ~~~~~~~~~~~~~~~ 2025-09-04T16:34:11,690 In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = long long unsigned int; _Tp = double; _Compare = std::less; _Alloc = std::allocator >]’, 2025-09-04T16:34:11,690 inlined from ‘NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::’ at networkit/cpp/community/CutClustering.cpp:157:30, 2025-09-04T16:34:11,690 inlined from ‘decltype (f(u, v, ew)) NetworKit::Graph::edgeLambda(F&, NetworKit::node, NetworKit::node, NetworKit::edgeweight, NetworKit::edgeid) const [with F = NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::; bool InEdges = false; typename std::enable_if<((Aux::FunctionTraits::arity >= 2) && std::is_same::arg<2>::type>::value)>::type* = 0]’ at networkit/cpp/community/../structures/../graph/Graph.h:247:11, 2025-09-04T16:34:11,690 inlined from ‘void NetworKit::Graph::forOutEdgesOfImpl(NetworKit::node, L) const [with bool graphIsDirected = false; bool hasWeights = false; bool graphHasEdgeIds = false; L = NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::]’ at networkit/cpp/community/../structures/../graph/Graph.h:1052:24, 2025-09-04T16:34:11,691 inlined from ‘void NetworKit::Graph::forEdgeImpl(L) const [with bool graphIsDirected = false; bool hasWeights = false; bool graphHasEdgeIds = true; L = NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::]’ at networkit/cpp/community/../structures/../graph/Graph.h:1081:69, 2025-09-04T16:34:11,691 inlined from ‘void NetworKit::Graph::forEdges(L) const [with L = NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::]’ at networkit/cpp/community/../structures/../graph/Graph.h:1134:37, 2025-09-04T16:34:11,691 inlined from ‘static void NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)’ at networkit/cpp/community/CutClustering.cpp:149:13: 2025-09-04T16:34:11,699 /usr/include/c++/14/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree, std::_Select1st >, std::less, std::allocator > >::const_iterator’ changed in GCC 7.1 2025-09-04T16:34:11,699 513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct, 2025-09-04T16:34:11,700 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:11,700 514 | std::tuple(__k), 2025-09-04T16:34:11,700 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:11,700 515 | std::tuple<>()); 2025-09-04T16:34:11,701 | ~~~~~~~~~~~~~~~ 2025-09-04T16:34:11,701 In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = long long unsigned int; _Tp = double; _Compare = std::less; _Alloc = std::allocator >]’, 2025-09-04T16:34:11,701 inlined from ‘NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::’ at networkit/cpp/community/CutClustering.cpp:151:30, 2025-09-04T16:34:11,701 inlined from ‘decltype (f(u, v, ew)) NetworKit::Graph::edgeLambda(F&, NetworKit::node, NetworKit::node, NetworKit::edgeweight, NetworKit::edgeid) const [with F = NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::; bool InEdges = false; typename std::enable_if<((Aux::FunctionTraits::arity >= 2) && std::is_same::arg<2>::type>::value)>::type* = 0]’ at networkit/cpp/community/../structures/../graph/Graph.h:247:11, 2025-09-04T16:34:11,702 inlined from ‘void NetworKit::Graph::forOutEdgesOfImpl(NetworKit::node, L) const [with bool graphIsDirected = false; bool hasWeights = true; bool graphHasEdgeIds = false; L = NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::]’ at networkit/cpp/community/../structures/../graph/Graph.h:1052:24, 2025-09-04T16:34:11,702 inlined from ‘void NetworKit::Graph::forEdgeImpl(L) const [with bool graphIsDirected = false; bool hasWeights = true; bool graphHasEdgeIds = true; L = NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::]’ at networkit/cpp/community/../structures/../graph/Graph.h:1081:69, 2025-09-04T16:34:11,702 inlined from ‘void NetworKit::Graph::forEdges(L) const [with L = NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::]’ at networkit/cpp/community/../structures/../graph/Graph.h:1138:36, 2025-09-04T16:34:11,702 inlined from ‘static void NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)’ at networkit/cpp/community/CutClustering.cpp:149:13: 2025-09-04T16:34:11,702 /usr/include/c++/14/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree, std::_Select1st >, std::less, std::allocator > >::const_iterator’ changed in GCC 7.1 2025-09-04T16:34:11,703 513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct, 2025-09-04T16:34:11,703 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:11,703 514 | std::tuple(__k), 2025-09-04T16:34:11,703 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:11,703 515 | std::tuple<>()); 2025-09-04T16:34:11,703 | ~~~~~~~~~~~~~~~ 2025-09-04T16:34:11,704 In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = long long unsigned int; _Tp = double; _Compare = std::less; _Alloc = std::allocator >]’, 2025-09-04T16:34:11,704 inlined from ‘NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::’ at networkit/cpp/community/CutClustering.cpp:152:30, 2025-09-04T16:34:11,704 inlined from ‘decltype (f(u, v, ew)) NetworKit::Graph::edgeLambda(F&, NetworKit::node, NetworKit::node, NetworKit::edgeweight, NetworKit::edgeid) const [with F = NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::; bool InEdges = false; typename std::enable_if<((Aux::FunctionTraits::arity >= 2) && std::is_same::arg<2>::type>::value)>::type* = 0]’ at networkit/cpp/community/../structures/../graph/Graph.h:247:11, 2025-09-04T16:34:11,704 inlined from ‘void NetworKit::Graph::forOutEdgesOfImpl(NetworKit::node, L) const [with bool graphIsDirected = false; bool hasWeights = true; bool graphHasEdgeIds = false; L = NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::]’ at networkit/cpp/community/../structures/../graph/Graph.h:1052:24, 2025-09-04T16:34:11,722 inlined from ‘void NetworKit::Graph::forEdgeImpl(L) const [with bool graphIsDirected = false; bool hasWeights = true; bool graphHasEdgeIds = true; L = NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::]’ at networkit/cpp/community/../structures/../graph/Graph.h:1081:69, 2025-09-04T16:34:11,722 inlined from ‘void NetworKit::Graph::forEdges(L) const [with L = NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::]’ at networkit/cpp/community/../structures/../graph/Graph.h:1138:36, 2025-09-04T16:34:11,722 inlined from ‘static void NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)’ at networkit/cpp/community/CutClustering.cpp:149:13: 2025-09-04T16:34:11,722 /usr/include/c++/14/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree, std::_Select1st >, std::less, std::allocator > >::const_iterator’ changed in GCC 7.1 2025-09-04T16:34:11,722 513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct, 2025-09-04T16:34:11,723 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:11,723 514 | std::tuple(__k), 2025-09-04T16:34:11,723 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:11,723 515 | std::tuple<>()); 2025-09-04T16:34:11,723 | ~~~~~~~~~~~~~~~ 2025-09-04T16:34:11,723 In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = long long unsigned int; _Tp = double; _Compare = std::less; _Alloc = std::allocator >]’, 2025-09-04T16:34:11,724 inlined from ‘NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::’ at networkit/cpp/community/CutClustering.cpp:156:30, 2025-09-04T16:34:11,724 inlined from ‘decltype (f(u, v, ew)) NetworKit::Graph::edgeLambda(F&, NetworKit::node, NetworKit::node, NetworKit::edgeweight, NetworKit::edgeid) const [with F = NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::; bool InEdges = false; typename std::enable_if<((Aux::FunctionTraits::arity >= 2) && std::is_same::arg<2>::type>::value)>::type* = 0]’ at networkit/cpp/community/../structures/../graph/Graph.h:247:11, 2025-09-04T16:34:11,724 inlined from ‘void NetworKit::Graph::forOutEdgesOfImpl(NetworKit::node, L) const [with bool graphIsDirected = false; bool hasWeights = true; bool graphHasEdgeIds = false; L = NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::]’ at networkit/cpp/community/../structures/../graph/Graph.h:1052:24, 2025-09-04T16:34:11,724 inlined from ‘void NetworKit::Graph::forEdgeImpl(L) const [with bool graphIsDirected = false; bool hasWeights = true; bool graphHasEdgeIds = true; L = NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::]’ at networkit/cpp/community/../structures/../graph/Graph.h:1081:69, 2025-09-04T16:34:11,725 inlined from ‘void NetworKit::Graph::forEdges(L) const [with L = NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::]’ at networkit/cpp/community/../structures/../graph/Graph.h:1138:36, 2025-09-04T16:34:11,725 inlined from ‘static void NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)’ at networkit/cpp/community/CutClustering.cpp:149:13: 2025-09-04T16:34:11,725 /usr/include/c++/14/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree, std::_Select1st >, std::less, std::allocator > >::const_iterator’ changed in GCC 7.1 2025-09-04T16:34:11,725 513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct, 2025-09-04T16:34:11,725 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:11,726 514 | std::tuple(__k), 2025-09-04T16:34:11,726 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:11,726 515 | std::tuple<>()); 2025-09-04T16:34:11,726 | ~~~~~~~~~~~~~~~ 2025-09-04T16:34:11,726 In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = long long unsigned int; _Tp = double; _Compare = std::less; _Alloc = std::allocator >]’, 2025-09-04T16:34:11,726 inlined from ‘NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::’ at networkit/cpp/community/CutClustering.cpp:157:30, 2025-09-04T16:34:11,727 inlined from ‘decltype (f(u, v, ew)) NetworKit::Graph::edgeLambda(F&, NetworKit::node, NetworKit::node, NetworKit::edgeweight, NetworKit::edgeid) const [with F = NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::; bool InEdges = false; typename std::enable_if<((Aux::FunctionTraits::arity >= 2) && std::is_same::arg<2>::type>::value)>::type* = 0]’ at networkit/cpp/community/../structures/../graph/Graph.h:247:11, 2025-09-04T16:34:11,727 inlined from ‘void NetworKit::Graph::forOutEdgesOfImpl(NetworKit::node, L) const [with bool graphIsDirected = false; bool hasWeights = true; bool graphHasEdgeIds = false; L = NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::]’ at networkit/cpp/community/../structures/../graph/Graph.h:1052:24, 2025-09-04T16:34:11,727 inlined from ‘void NetworKit::Graph::forEdgeImpl(L) const [with bool graphIsDirected = false; bool hasWeights = true; bool graphHasEdgeIds = true; L = NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::]’ at networkit/cpp/community/../structures/../graph/Graph.h:1081:69, 2025-09-04T16:34:11,727 inlined from ‘void NetworKit::Graph::forEdges(L) const [with L = NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::]’ at networkit/cpp/community/../structures/../graph/Graph.h:1138:36, 2025-09-04T16:34:11,727 inlined from ‘static void NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)’ at networkit/cpp/community/CutClustering.cpp:149:13: 2025-09-04T16:34:11,728 /usr/include/c++/14/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree, std::_Select1st >, std::less, std::allocator > >::const_iterator’ changed in GCC 7.1 2025-09-04T16:34:11,728 513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct, 2025-09-04T16:34:11,728 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:11,728 514 | std::tuple(__k), 2025-09-04T16:34:11,728 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:11,728 515 | std::tuple<>()); 2025-09-04T16:34:11,728 | ~~~~~~~~~~~~~~~ 2025-09-04T16:34:11,729 In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = long long unsigned int; _Tp = double; _Compare = std::less; _Alloc = std::allocator >]’, 2025-09-04T16:34:11,729 inlined from ‘NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::’ at networkit/cpp/community/CutClustering.cpp:151:30, 2025-09-04T16:34:11,729 inlined from ‘decltype (f(u, v, ew)) NetworKit::Graph::edgeLambda(F&, NetworKit::node, NetworKit::node, NetworKit::edgeweight, NetworKit::edgeid) const [with F = NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::; bool InEdges = false; typename std::enable_if<((Aux::FunctionTraits::arity >= 2) && std::is_same::arg<2>::type>::value)>::type* = 0]’ at networkit/cpp/community/../structures/../graph/Graph.h:247:11, 2025-09-04T16:34:11,729 inlined from ‘void NetworKit::Graph::forOutEdgesOfImpl(NetworKit::node, L) const [with bool graphIsDirected = true; bool hasWeights = false; bool graphHasEdgeIds = false; L = NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::]’ at networkit/cpp/community/../structures/../graph/Graph.h:1052:24, 2025-09-04T16:34:11,729 inlined from ‘void NetworKit::Graph::forEdgeImpl(L) const [with bool graphIsDirected = true; bool hasWeights = false; bool graphHasEdgeIds = true; L = NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::]’ at networkit/cpp/community/../structures/../graph/Graph.h:1081:69, 2025-09-04T16:34:11,729 inlined from ‘void NetworKit::Graph::forEdges(L) const [with L = NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::]’ at networkit/cpp/community/../structures/../graph/Graph.h:1142:36, 2025-09-04T16:34:11,730 inlined from ‘static void NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)’ at networkit/cpp/community/CutClustering.cpp:149:13: 2025-09-04T16:34:11,730 /usr/include/c++/14/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree, std::_Select1st >, std::less, std::allocator > >::const_iterator’ changed in GCC 7.1 2025-09-04T16:34:11,730 513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct, 2025-09-04T16:34:11,730 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:11,730 514 | std::tuple(__k), 2025-09-04T16:34:11,730 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:11,730 515 | std::tuple<>()); 2025-09-04T16:34:11,731 | ~~~~~~~~~~~~~~~ 2025-09-04T16:34:11,731 In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = long long unsigned int; _Tp = double; _Compare = std::less; _Alloc = std::allocator >]’, 2025-09-04T16:34:11,731 inlined from ‘NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::’ at networkit/cpp/community/CutClustering.cpp:152:30, 2025-09-04T16:34:11,731 inlined from ‘decltype (f(u, v, ew)) NetworKit::Graph::edgeLambda(F&, NetworKit::node, NetworKit::node, NetworKit::edgeweight, NetworKit::edgeid) const [with F = NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::; bool InEdges = false; typename std::enable_if<((Aux::FunctionTraits::arity >= 2) && std::is_same::arg<2>::type>::value)>::type* = 0]’ at networkit/cpp/community/../structures/../graph/Graph.h:247:11, 2025-09-04T16:34:11,731 inlined from ‘void NetworKit::Graph::forOutEdgesOfImpl(NetworKit::node, L) const [with bool graphIsDirected = true; bool hasWeights = false; bool graphHasEdgeIds = false; L = NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::]’ at networkit/cpp/community/../structures/../graph/Graph.h:1052:24, 2025-09-04T16:34:11,731 inlined from ‘void NetworKit::Graph::forEdgeImpl(L) const [with bool graphIsDirected = true; bool hasWeights = false; bool graphHasEdgeIds = true; L = NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::]’ at networkit/cpp/community/../structures/../graph/Graph.h:1081:69, 2025-09-04T16:34:11,742 inlined from ‘void NetworKit::Graph::forEdges(L) const [with L = NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::]’ at networkit/cpp/community/../structures/../graph/Graph.h:1142:36, 2025-09-04T16:34:11,742 inlined from ‘static void NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)’ at networkit/cpp/community/CutClustering.cpp:149:13: 2025-09-04T16:34:11,742 /usr/include/c++/14/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree, std::_Select1st >, std::less, std::allocator > >::const_iterator’ changed in GCC 7.1 2025-09-04T16:34:11,742 513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct, 2025-09-04T16:34:11,742 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:11,743 514 | std::tuple(__k), 2025-09-04T16:34:11,743 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:11,743 515 | std::tuple<>()); 2025-09-04T16:34:11,743 | ~~~~~~~~~~~~~~~ 2025-09-04T16:34:11,743 In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = long long unsigned int; _Tp = double; _Compare = std::less; _Alloc = std::allocator >]’, 2025-09-04T16:34:11,743 inlined from ‘NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::’ at networkit/cpp/community/CutClustering.cpp:156:30, 2025-09-04T16:34:11,744 inlined from ‘decltype (f(u, v, ew)) NetworKit::Graph::edgeLambda(F&, NetworKit::node, NetworKit::node, NetworKit::edgeweight, NetworKit::edgeid) const [with F = NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::; bool InEdges = false; typename std::enable_if<((Aux::FunctionTraits::arity >= 2) && std::is_same::arg<2>::type>::value)>::type* = 0]’ at networkit/cpp/community/../structures/../graph/Graph.h:247:11, 2025-09-04T16:34:11,744 inlined from ‘void NetworKit::Graph::forOutEdgesOfImpl(NetworKit::node, L) const [with bool graphIsDirected = true; bool hasWeights = false; bool graphHasEdgeIds = false; L = NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::]’ at networkit/cpp/community/../structures/../graph/Graph.h:1052:24, 2025-09-04T16:34:11,744 inlined from ‘void NetworKit::Graph::forEdgeImpl(L) const [with bool graphIsDirected = true; bool hasWeights = false; bool graphHasEdgeIds = true; L = NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::]’ at networkit/cpp/community/../structures/../graph/Graph.h:1081:69, 2025-09-04T16:34:11,744 inlined from ‘void NetworKit::Graph::forEdges(L) const [with L = NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::]’ at networkit/cpp/community/../structures/../graph/Graph.h:1142:36, 2025-09-04T16:34:11,744 inlined from ‘static void NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)’ at networkit/cpp/community/CutClustering.cpp:149:13: 2025-09-04T16:34:11,744 /usr/include/c++/14/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree, std::_Select1st >, std::less, std::allocator > >::const_iterator’ changed in GCC 7.1 2025-09-04T16:34:11,745 513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct, 2025-09-04T16:34:11,745 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:11,745 514 | std::tuple(__k), 2025-09-04T16:34:11,745 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:11,745 515 | std::tuple<>()); 2025-09-04T16:34:11,745 | ~~~~~~~~~~~~~~~ 2025-09-04T16:34:11,745 In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = long long unsigned int; _Tp = double; _Compare = std::less; _Alloc = std::allocator >]’, 2025-09-04T16:34:11,746 inlined from ‘NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::’ at networkit/cpp/community/CutClustering.cpp:157:30, 2025-09-04T16:34:11,746 inlined from ‘decltype (f(u, v, ew)) NetworKit::Graph::edgeLambda(F&, NetworKit::node, NetworKit::node, NetworKit::edgeweight, NetworKit::edgeid) const [with F = NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::; bool InEdges = false; typename std::enable_if<((Aux::FunctionTraits::arity >= 2) && std::is_same::arg<2>::type>::value)>::type* = 0]’ at networkit/cpp/community/../structures/../graph/Graph.h:247:11, 2025-09-04T16:34:11,746 inlined from ‘void NetworKit::Graph::forOutEdgesOfImpl(NetworKit::node, L) const [with bool graphIsDirected = true; bool hasWeights = false; bool graphHasEdgeIds = false; L = NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::]’ at networkit/cpp/community/../structures/../graph/Graph.h:1052:24, 2025-09-04T16:34:11,746 inlined from ‘void NetworKit::Graph::forEdgeImpl(L) const [with bool graphIsDirected = true; bool hasWeights = false; bool graphHasEdgeIds = true; L = NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::]’ at networkit/cpp/community/../structures/../graph/Graph.h:1081:69, 2025-09-04T16:34:11,746 inlined from ‘void NetworKit::Graph::forEdges(L) const [with L = NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::]’ at networkit/cpp/community/../structures/../graph/Graph.h:1142:36, 2025-09-04T16:34:11,746 inlined from ‘static void NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)’ at networkit/cpp/community/CutClustering.cpp:149:13: 2025-09-04T16:34:11,747 /usr/include/c++/14/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree, std::_Select1st >, std::less, std::allocator > >::const_iterator’ changed in GCC 7.1 2025-09-04T16:34:11,747 513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct, 2025-09-04T16:34:11,747 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:11,747 514 | std::tuple(__k), 2025-09-04T16:34:11,747 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:11,747 515 | std::tuple<>()); 2025-09-04T16:34:11,747 | ~~~~~~~~~~~~~~~ 2025-09-04T16:34:11,748 In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = long long unsigned int; _Tp = double; _Compare = std::less; _Alloc = std::allocator >]’, 2025-09-04T16:34:11,748 inlined from ‘NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::’ at networkit/cpp/community/CutClustering.cpp:151:30, 2025-09-04T16:34:11,748 inlined from ‘decltype (f(u, v, ew)) NetworKit::Graph::edgeLambda(F&, NetworKit::node, NetworKit::node, NetworKit::edgeweight, NetworKit::edgeid) const [with F = NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::; bool InEdges = false; typename std::enable_if<((Aux::FunctionTraits::arity >= 2) && std::is_same::arg<2>::type>::value)>::type* = 0]’ at networkit/cpp/community/../structures/../graph/Graph.h:247:11, 2025-09-04T16:34:11,748 inlined from ‘void NetworKit::Graph::forOutEdgesOfImpl(NetworKit::node, L) const [with bool graphIsDirected = true; bool hasWeights = true; bool graphHasEdgeIds = false; L = NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::]’ at networkit/cpp/community/../structures/../graph/Graph.h:1052:24, 2025-09-04T16:34:11,748 inlined from ‘void NetworKit::Graph::forEdgeImpl(L) const [with bool graphIsDirected = true; bool hasWeights = true; bool graphHasEdgeIds = true; L = NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::]’ at networkit/cpp/community/../structures/../graph/Graph.h:1081:69, 2025-09-04T16:34:11,749 inlined from ‘void NetworKit::Graph::forEdges(L) const [with L = NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::]’ at networkit/cpp/community/../structures/../graph/Graph.h:1146:35, 2025-09-04T16:34:11,749 inlined from ‘static void NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)’ at networkit/cpp/community/CutClustering.cpp:149:13: 2025-09-04T16:34:11,749 /usr/include/c++/14/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree, std::_Select1st >, std::less, std::allocator > >::const_iterator’ changed in GCC 7.1 2025-09-04T16:34:11,749 513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct, 2025-09-04T16:34:11,749 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:11,750 514 | std::tuple(__k), 2025-09-04T16:34:11,750 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:11,750 515 | std::tuple<>()); 2025-09-04T16:34:11,750 | ~~~~~~~~~~~~~~~ 2025-09-04T16:34:11,750 In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = long long unsigned int; _Tp = double; _Compare = std::less; _Alloc = std::allocator >]’, 2025-09-04T16:34:11,750 inlined from ‘NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::’ at networkit/cpp/community/CutClustering.cpp:152:30, 2025-09-04T16:34:11,751 inlined from ‘decltype (f(u, v, ew)) NetworKit::Graph::edgeLambda(F&, NetworKit::node, NetworKit::node, NetworKit::edgeweight, NetworKit::edgeid) const [with F = NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::; bool InEdges = false; typename std::enable_if<((Aux::FunctionTraits::arity >= 2) && std::is_same::arg<2>::type>::value)>::type* = 0]’ at networkit/cpp/community/../structures/../graph/Graph.h:247:11, 2025-09-04T16:34:11,751 inlined from ‘void NetworKit::Graph::forOutEdgesOfImpl(NetworKit::node, L) const [with bool graphIsDirected = true; bool hasWeights = true; bool graphHasEdgeIds = false; L = NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::]’ at networkit/cpp/community/../structures/../graph/Graph.h:1052:24, 2025-09-04T16:34:11,751 inlined from ‘void NetworKit::Graph::forEdgeImpl(L) const [with bool graphIsDirected = true; bool hasWeights = true; bool graphHasEdgeIds = true; L = NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::]’ at networkit/cpp/community/../structures/../graph/Graph.h:1081:69, 2025-09-04T16:34:11,751 inlined from ‘void NetworKit::Graph::forEdges(L) const [with L = NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::]’ at networkit/cpp/community/../structures/../graph/Graph.h:1146:35, 2025-09-04T16:34:11,751 inlined from ‘static void NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)’ at networkit/cpp/community/CutClustering.cpp:149:13: 2025-09-04T16:34:11,762 /usr/include/c++/14/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree, std::_Select1st >, std::less, std::allocator > >::const_iterator’ changed in GCC 7.1 2025-09-04T16:34:11,762 513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct, 2025-09-04T16:34:11,762 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:11,763 514 | std::tuple(__k), 2025-09-04T16:34:11,763 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:11,763 515 | std::tuple<>()); 2025-09-04T16:34:11,763 | ~~~~~~~~~~~~~~~ 2025-09-04T16:34:11,763 In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = long long unsigned int; _Tp = double; _Compare = std::less; _Alloc = std::allocator >]’, 2025-09-04T16:34:11,764 inlined from ‘NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::’ at networkit/cpp/community/CutClustering.cpp:156:30, 2025-09-04T16:34:11,764 inlined from ‘decltype (f(u, v, ew)) NetworKit::Graph::edgeLambda(F&, NetworKit::node, NetworKit::node, NetworKit::edgeweight, NetworKit::edgeid) const [with F = NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::; bool InEdges = false; typename std::enable_if<((Aux::FunctionTraits::arity >= 2) && std::is_same::arg<2>::type>::value)>::type* = 0]’ at networkit/cpp/community/../structures/../graph/Graph.h:247:11, 2025-09-04T16:34:11,764 inlined from ‘void NetworKit::Graph::forOutEdgesOfImpl(NetworKit::node, L) const [with bool graphIsDirected = true; bool hasWeights = true; bool graphHasEdgeIds = false; L = NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::]’ at networkit/cpp/community/../structures/../graph/Graph.h:1052:24, 2025-09-04T16:34:11,764 inlined from ‘void NetworKit::Graph::forEdgeImpl(L) const [with bool graphIsDirected = true; bool hasWeights = true; bool graphHasEdgeIds = true; L = NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::]’ at networkit/cpp/community/../structures/../graph/Graph.h:1081:69, 2025-09-04T16:34:11,765 inlined from ‘void NetworKit::Graph::forEdges(L) const [with L = NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::]’ at networkit/cpp/community/../structures/../graph/Graph.h:1146:35, 2025-09-04T16:34:11,765 inlined from ‘static void NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)’ at networkit/cpp/community/CutClustering.cpp:149:13: 2025-09-04T16:34:11,765 /usr/include/c++/14/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree, std::_Select1st >, std::less, std::allocator > >::const_iterator’ changed in GCC 7.1 2025-09-04T16:34:11,765 513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct, 2025-09-04T16:34:11,765 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:11,766 514 | std::tuple(__k), 2025-09-04T16:34:11,766 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:11,766 515 | std::tuple<>()); 2025-09-04T16:34:11,766 | ~~~~~~~~~~~~~~~ 2025-09-04T16:34:11,766 In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = long long unsigned int; _Tp = double; _Compare = std::less; _Alloc = std::allocator >]’, 2025-09-04T16:34:11,766 inlined from ‘NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::’ at networkit/cpp/community/CutClustering.cpp:157:30, 2025-09-04T16:34:11,766 inlined from ‘decltype (f(u, v, ew)) NetworKit::Graph::edgeLambda(F&, NetworKit::node, NetworKit::node, NetworKit::edgeweight, NetworKit::edgeid) const [with F = NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::; bool InEdges = false; typename std::enable_if<((Aux::FunctionTraits::arity >= 2) && std::is_same::arg<2>::type>::value)>::type* = 0]’ at networkit/cpp/community/../structures/../graph/Graph.h:247:11, 2025-09-04T16:34:11,767 inlined from ‘void NetworKit::Graph::forOutEdgesOfImpl(NetworKit::node, L) const [with bool graphIsDirected = true; bool hasWeights = true; bool graphHasEdgeIds = false; L = NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::]’ at networkit/cpp/community/../structures/../graph/Graph.h:1052:24, 2025-09-04T16:34:11,767 inlined from ‘void NetworKit::Graph::forEdgeImpl(L) const [with bool graphIsDirected = true; bool hasWeights = true; bool graphHasEdgeIds = true; L = NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::]’ at networkit/cpp/community/../structures/../graph/Graph.h:1081:69, 2025-09-04T16:34:11,767 inlined from ‘void NetworKit::Graph::forEdges(L) const [with L = NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::]’ at networkit/cpp/community/../structures/../graph/Graph.h:1146:35, 2025-09-04T16:34:11,767 inlined from ‘static void NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)’ at networkit/cpp/community/CutClustering.cpp:149:13: 2025-09-04T16:34:11,768 /usr/include/c++/14/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree, std::_Select1st >, std::less, std::allocator > >::const_iterator’ changed in GCC 7.1 2025-09-04T16:34:11,768 513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct, 2025-09-04T16:34:11,768 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:11,768 514 | std::tuple(__k), 2025-09-04T16:34:11,768 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:11,769 515 | std::tuple<>()); 2025-09-04T16:34:11,769 | ~~~~~~~~~~~~~~~ 2025-09-04T16:34:11,769 In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = long long unsigned int; _Tp = long long unsigned int; _Compare = std::less; _Alloc = std::allocator >]’, 2025-09-04T16:34:11,769 inlined from ‘NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::’ at networkit/cpp/community/CutClustering.cpp:162:33, 2025-09-04T16:34:11,769 inlined from ‘void NetworKit::Graph::forNodes(L) const [with L = NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::]’ at networkit/cpp/community/../structures/../graph/Graph.h:916:10, 2025-09-04T16:34:11,770 inlined from ‘static void NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)’ at networkit/cpp/community/CutClustering.cpp:161:13: 2025-09-04T16:34:11,770 /usr/include/c++/14/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree, std::_Select1st >, std::less, std::allocator > >::const_iterator’ changed in GCC 7.1 2025-09-04T16:34:11,770 513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct, 2025-09-04T16:34:11,770 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:11,770 514 | std::tuple(__k), 2025-09-04T16:34:11,771 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:11,771 515 | std::tuple<>()); 2025-09-04T16:34:11,771 | ~~~~~~~~~~~~~~~ 2025-09-04T16:34:11,771 In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = long long unsigned int; _Tp = long long unsigned int; _Compare = std::less; _Alloc = std::allocator >]’, 2025-09-04T16:34:11,782 inlined from ‘NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::’ at networkit/cpp/community/CutClustering.cpp:163:33, 2025-09-04T16:34:11,782 inlined from ‘void NetworKit::Graph::forNodes(L) const [with L = NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::]’ at networkit/cpp/community/../structures/../graph/Graph.h:916:10, 2025-09-04T16:34:11,782 inlined from ‘static void NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)’ at networkit/cpp/community/CutClustering.cpp:161:13: 2025-09-04T16:34:11,782 /usr/include/c++/14/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree, std::_Select1st >, std::less, std::allocator > >::const_iterator’ changed in GCC 7.1 2025-09-04T16:34:11,782 513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct, 2025-09-04T16:34:11,783 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:11,783 514 | std::tuple(__k), 2025-09-04T16:34:11,783 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:11,783 515 | std::tuple<>()); 2025-09-04T16:34:11,783 | ~~~~~~~~~~~~~~~ 2025-09-04T16:34:11,783 In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = long long unsigned int; _Tp = long long unsigned int; _Compare = std::less; _Alloc = std::allocator >]’, 2025-09-04T16:34:11,783 inlined from ‘static void NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)’ at networkit/cpp/community/CutClustering.cpp:167:55: 2025-09-04T16:34:11,784 /usr/include/c++/14/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree, std::_Select1st >, std::less, std::allocator > >::const_iterator’ changed in GCC 7.1 2025-09-04T16:34:11,784 513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct, 2025-09-04T16:34:11,784 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:11,784 514 | std::tuple(__k), 2025-09-04T16:34:11,784 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:11,784 515 | std::tuple<>()); 2025-09-04T16:34:11,784 | ~~~~~~~~~~~~~~~ 2025-09-04T16:34:11,785 In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = long long unsigned int; _Tp = long long unsigned int; _Compare = std::less; _Alloc = std::allocator >]’, 2025-09-04T16:34:11,785 inlined from ‘static void NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)’ at networkit/cpp/community/CutClustering.cpp:170:56: 2025-09-04T16:34:11,785 /usr/include/c++/14/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree, std::_Select1st >, std::less, std::allocator > >::const_iterator’ changed in GCC 7.1 2025-09-04T16:34:11,785 513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct, 2025-09-04T16:34:11,785 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:11,785 514 | std::tuple(__k), 2025-09-04T16:34:11,785 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:11,786 515 | std::tuple<>()); 2025-09-04T16:34:11,786 | ~~~~~~~~~~~~~~~ 2025-09-04T16:34:11,786 In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = long long unsigned int; _Tp = double; _Compare = std::less; _Alloc = std::allocator >]’, 2025-09-04T16:34:11,786 inlined from ‘static void NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)’ at networkit/cpp/community/CutClustering.cpp:174:46: 2025-09-04T16:34:11,786 /usr/include/c++/14/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree, std::_Select1st >, std::less, std::allocator > >::const_iterator’ changed in GCC 7.1 2025-09-04T16:34:11,786 513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct, 2025-09-04T16:34:11,787 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:11,787 514 | std::tuple(__k), 2025-09-04T16:34:11,787 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:11,787 515 | std::tuple<>()); 2025-09-04T16:34:11,787 | ~~~~~~~~~~~~~~~ 2025-09-04T16:34:11,787 In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = long long unsigned int; _Tp = double; _Compare = std::less; _Alloc = std::allocator >]’, 2025-09-04T16:34:11,788 inlined from ‘static void NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)’ at networkit/cpp/community/CutClustering.cpp:175:61: 2025-09-04T16:34:11,788 /usr/include/c++/14/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree, std::_Select1st >, std::less, std::allocator > >::const_iterator’ changed in GCC 7.1 2025-09-04T16:34:11,788 513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct, 2025-09-04T16:34:11,788 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:11,788 514 | std::tuple(__k), 2025-09-04T16:34:11,789 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:11,789 515 | std::tuple<>()); 2025-09-04T16:34:11,789 | ~~~~~~~~~~~~~~~ 2025-09-04T16:34:11,789 In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = long long unsigned int; _Tp = double; _Compare = std::less; _Alloc = std::allocator >]’, 2025-09-04T16:34:11,789 inlined from ‘NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::’ at networkit/cpp/community/CutClustering.cpp:182:44, 2025-09-04T16:34:11,789 inlined from ‘void NetworKit::Graph::forNodes(L) const [with L = NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::]’ at networkit/cpp/community/../structures/../graph/Graph.h:916:10, 2025-09-04T16:34:11,790 inlined from ‘static void NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)’ at networkit/cpp/community/CutClustering.cpp:180:14: 2025-09-04T16:34:11,790 /usr/include/c++/14/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree, std::_Select1st >, std::less, std::allocator > >::const_iterator’ changed in GCC 7.1 2025-09-04T16:34:11,790 513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct, 2025-09-04T16:34:11,790 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:11,791 514 | std::tuple(__k), 2025-09-04T16:34:11,791 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:11,791 515 | std::tuple<>()); 2025-09-04T16:34:11,791 | ~~~~~~~~~~~~~~~ 2025-09-04T16:34:11,801 In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = long long unsigned int; _Tp = long long unsigned int; _Compare = std::less; _Alloc = std::allocator >]’, 2025-09-04T16:34:11,802 inlined from ‘NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::’ at networkit/cpp/community/CutClustering.cpp:182:88, 2025-09-04T16:34:11,802 inlined from ‘void NetworKit::Graph::forNodes(L) const [with L = NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::]’ at networkit/cpp/community/../structures/../graph/Graph.h:916:10, 2025-09-04T16:34:11,802 inlined from ‘static void NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)’ at networkit/cpp/community/CutClustering.cpp:180:14: 2025-09-04T16:34:11,802 /usr/include/c++/14/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree, std::_Select1st >, std::less, std::allocator > >::const_iterator’ changed in GCC 7.1 2025-09-04T16:34:11,803 513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct, 2025-09-04T16:34:11,803 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:11,803 514 | std::tuple(__k), 2025-09-04T16:34:11,803 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:11,803 515 | std::tuple<>()); 2025-09-04T16:34:11,803 | ~~~~~~~~~~~~~~~ 2025-09-04T16:34:11,804 In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = long long unsigned int; _Tp = double; _Compare = std::less; _Alloc = std::allocator >]’, 2025-09-04T16:34:11,804 inlined from ‘NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::’ at networkit/cpp/community/CutClustering.cpp:187:31, 2025-09-04T16:34:11,804 inlined from ‘void NetworKit::Graph::forNodes(L) const [with L = NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::]’ at networkit/cpp/community/../structures/../graph/Graph.h:916:10, 2025-09-04T16:34:11,804 inlined from ‘static void NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)’ at networkit/cpp/community/CutClustering.cpp:180:14: 2025-09-04T16:34:11,805 /usr/include/c++/14/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree, std::_Select1st >, std::less, std::allocator > >::const_iterator’ changed in GCC 7.1 2025-09-04T16:34:11,805 513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct, 2025-09-04T16:34:11,805 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:11,805 514 | std::tuple(__k), 2025-09-04T16:34:11,806 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:11,806 515 | std::tuple<>()); 2025-09-04T16:34:11,806 | ~~~~~~~~~~~~~~~ 2025-09-04T16:34:11,806 In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = long long unsigned int; _Tp = long long unsigned int; _Compare = std::less; _Alloc = std::allocator >]’, 2025-09-04T16:34:11,806 inlined from ‘NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::’ at networkit/cpp/community/CutClustering.cpp:188:31, 2025-09-04T16:34:11,807 inlined from ‘void NetworKit::Graph::forNodes(L) const [with L = NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)::]’ at networkit/cpp/community/../structures/../graph/Graph.h:916:10, 2025-09-04T16:34:11,807 inlined from ‘static void NetworKit::CutClustering::clusterHierarchyRecursion(const NetworKit::Graph&, NetworKit::edgeweight, NetworKit::Partition, NetworKit::edgeweight, NetworKit::Partition, std::map&)’ at networkit/cpp/community/CutClustering.cpp:180:14: 2025-09-04T16:34:11,807 /usr/include/c++/14/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree, std::_Select1st >, std::less, std::allocator > >::const_iterator’ changed in GCC 7.1 2025-09-04T16:34:11,807 513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct, 2025-09-04T16:34:11,807 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:11,808 514 | std::tuple(__k), 2025-09-04T16:34:11,808 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:11,808 515 | std::tuple<>()); 2025-09-04T16:34:11,808 | ~~~~~~~~~~~~~~~ 2025-09-04T16:34:11,825 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/PathGrowingMatcher.o networkit/cpp/matching/PathGrowingMatcher.cpp 2025-09-04T16:34:14,157 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/ParallelMatcher.o networkit/cpp/matching/ParallelMatcher.cpp 2025-09-04T16:34:14,183 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/Matcher.o networkit/cpp/matching/Matcher.cpp 2025-09-04T16:34:14,852 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/Matching.o networkit/cpp/matching/Matching.cpp 2025-09-04T16:34:18,003 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/GraphCoarsening.o networkit/cpp/coarsening/GraphCoarsening.cpp 2025-09-04T16:34:18,447 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/PartitionCoarsening.o networkit/cpp/coarsening/PartitionCoarsening.cpp 2025-09-04T16:34:19,397 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/ParallelPartitionCoarsening.o networkit/cpp/coarsening/ParallelPartitionCoarsening.cpp 2025-09-04T16:34:21,685 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/MatchingContracter.o networkit/cpp/coarsening/MatchingContracter.cpp 2025-09-04T16:34:22,257 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/ClusterContractor.o networkit/cpp/coarsening/ClusterContractor.cpp 2025-09-04T16:34:27,036 In file included from /usr/include/c++/14/map:62, 2025-09-04T16:34:27,036 from networkit/cpp/coarsening/../ext/ttmath/ttmathobjects.h:50, 2025-09-04T16:34:27,036 from networkit/cpp/coarsening/../ext/ttmath/ttmath.h:59, 2025-09-04T16:34:27,037 from networkit/cpp/coarsening/../Globals.h:15, 2025-09-04T16:34:27,037 from networkit/cpp/coarsening/ParallelPartitionCoarsening.h:11, 2025-09-04T16:34:27,037 from networkit/cpp/coarsening/ParallelPartitionCoarsening.cpp:8: 2025-09-04T16:34:27,037 /usr/include/c++/14/bits/stl_tree.h: In function ‘std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_emplace_hint_unique(const_iterator, _Args&& ...) [with _Args = {const std::piecewise_construct_t&, std::tuple, std::tuple<>}; _Key = long long unsigned int; _Val = std::pair; _KeyOfValue = std::_Select1st >; _Compare = std::less; _Alloc = std::allocator >]’: 2025-09-04T16:34:27,037 /usr/include/c++/14/bits/stl_tree.h:2456:7: note: parameter passing for argument of type ‘std::_Rb_tree, std::_Select1st >, std::less, std::allocator > >::const_iterator’ changed in GCC 7.1 2025-09-04T16:34:27,038 2456 | _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>:: 2025-09-04T16:34:27,038 | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:27,142 /usr/include/c++/14/bits/stl_tree.h: In function ‘std::pair std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_get_insert_hint_unique_pos(const_iterator, const key_type&) [with _Key = long long unsigned int; _Val = std::pair; _KeyOfValue = std::_Select1st >; _Compare = std::less; _Alloc = std::allocator >]’: 2025-09-04T16:34:27,143 /usr/include/c++/14/bits/stl_tree.h:2208:5: note: parameter passing for argument of type ‘std::_Rb_tree, std::_Select1st >, std::less, std::allocator > >::const_iterator’ changed in GCC 7.1 2025-09-04T16:34:27,143 2208 | _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>:: 2025-09-04T16:34:27,143 | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:27,432 In file included from /usr/include/c++/14/map:63: 2025-09-04T16:34:27,432 In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = long long unsigned int; _Tp = double; _Compare = std::less; _Alloc = std::allocator >]’, 2025-09-04T16:34:27,432 inlined from ‘NetworKit::ParallelPartitionCoarsening::run(const NetworKit::Graph&, const NetworKit::Partition&)::’ at networkit/cpp/coarsening/ParallelPartitionCoarsening.cpp:134:18, 2025-09-04T16:34:27,433 inlined from ‘decltype (f(u, ew)) NetworKit::Graph::edgeLambda(F&, NetworKit::node, NetworKit::node, NetworKit::edgeweight, NetworKit::edgeid) const [with F = NetworKit::ParallelPartitionCoarsening::run(const NetworKit::Graph&, const NetworKit::Partition&)::; bool InEdges = false; typename std::enable_if<((Aux::FunctionTraits::arity >= 1) && std::is_same::arg<1>::type>::value)>::type* = 0]’ at networkit/cpp/coarsening/../graph/Graph.h:279:12, 2025-09-04T16:34:27,433 inlined from ‘void NetworKit::Graph::forOutEdgesOfImpl(NetworKit::node, L) const [with bool graphIsDirected = true; bool hasWeights = true; bool graphHasEdgeIds = false; L = NetworKit::ParallelPartitionCoarsening::run(const NetworKit::Graph&, const NetworKit::Partition&)::]’ at networkit/cpp/coarsening/../graph/Graph.h:1052:24, 2025-09-04T16:34:27,433 inlined from ‘void NetworKit::Graph::forEdgesOf(NetworKit::node, L) const [with L = NetworKit::ParallelPartitionCoarsening::run(const NetworKit::Graph&, const NetworKit::Partition&)::]’ at networkit/cpp/coarsening/../graph/Graph.h:1206:42, 2025-09-04T16:34:27,433 inlined from ‘void NetworKit::Graph::forNeighborsOf(NetworKit::node, L) const [with L = NetworKit::ParallelPartitionCoarsening::run(const NetworKit::Graph&, const NetworKit::Partition&)::]’ at networkit/cpp/coarsening/../graph/Graph.h:1195:12, 2025-09-04T16:34:27,434 inlined from ‘_ZN9NetworKit27ParallelPartitionCoarsening3runERKNS_5GraphERKNS_9PartitionE._omp_fn.0’ at networkit/cpp/coarsening/ParallelPartitionCoarsening.cpp:131:21: 2025-09-04T16:34:27,434 /usr/include/c++/14/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree, std::_Select1st >, std::less, std::allocator > >::const_iterator’ changed in GCC 7.1 2025-09-04T16:34:27,434 513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct, 2025-09-04T16:34:27,434 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:27,435 514 | std::tuple(__k), 2025-09-04T16:34:27,435 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:27,435 515 | std::tuple<>()); 2025-09-04T16:34:27,435 | ~~~~~~~~~~~~~~~ 2025-09-04T16:34:27,436 In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = long long unsigned int; _Tp = double; _Compare = std::less; _Alloc = std::allocator >]’, 2025-09-04T16:34:27,436 inlined from ‘NetworKit::ParallelPartitionCoarsening::run(const NetworKit::Graph&, const NetworKit::Partition&)::’ at networkit/cpp/coarsening/ParallelPartitionCoarsening.cpp:134:18, 2025-09-04T16:34:27,436 inlined from ‘decltype (f(u, ew)) NetworKit::Graph::edgeLambda(F&, NetworKit::node, NetworKit::node, NetworKit::edgeweight, NetworKit::edgeid) const [with F = NetworKit::ParallelPartitionCoarsening::run(const NetworKit::Graph&, const NetworKit::Partition&)::; bool InEdges = false; typename std::enable_if<((Aux::FunctionTraits::arity >= 1) && std::is_same::arg<1>::type>::value)>::type* = 0]’ at networkit/cpp/coarsening/../graph/Graph.h:279:12, 2025-09-04T16:34:27,437 inlined from ‘void NetworKit::Graph::forOutEdgesOfImpl(NetworKit::node, L) const [with bool graphIsDirected = true; bool hasWeights = true; bool graphHasEdgeIds = false; L = NetworKit::ParallelPartitionCoarsening::run(const NetworKit::Graph&, const NetworKit::Partition&)::]’ at networkit/cpp/coarsening/../graph/Graph.h:1052:24, 2025-09-04T16:34:27,437 inlined from ‘void NetworKit::Graph::forEdgesOf(NetworKit::node, L) const [with L = NetworKit::ParallelPartitionCoarsening::run(const NetworKit::Graph&, const NetworKit::Partition&)::]’ at networkit/cpp/coarsening/../graph/Graph.h:1214:41, 2025-09-04T16:34:27,437 inlined from ‘void NetworKit::Graph::forNeighborsOf(NetworKit::node, L) const [with L = NetworKit::ParallelPartitionCoarsening::run(const NetworKit::Graph&, const NetworKit::Partition&)::]’ at networkit/cpp/coarsening/../graph/Graph.h:1195:12, 2025-09-04T16:34:27,437 inlined from ‘_ZN9NetworKit27ParallelPartitionCoarsening3runERKNS_5GraphERKNS_9PartitionE._omp_fn.0’ at networkit/cpp/coarsening/ParallelPartitionCoarsening.cpp:131:21: 2025-09-04T16:34:27,438 /usr/include/c++/14/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree, std::_Select1st >, std::less, std::allocator > >::const_iterator’ changed in GCC 7.1 2025-09-04T16:34:27,438 513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct, 2025-09-04T16:34:27,438 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:27,438 514 | std::tuple(__k), 2025-09-04T16:34:27,438 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:27,439 515 | std::tuple<>()); 2025-09-04T16:34:27,439 | ~~~~~~~~~~~~~~~ 2025-09-04T16:34:27,941 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/ClusteringProjector.o networkit/cpp/coarsening/ClusteringProjector.cpp 2025-09-04T16:34:28,615 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/Matrix.o networkit/cpp/algebraic/Matrix.cpp 2025-09-04T16:34:29,891 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/LaplacianMatrix.o networkit/cpp/algebraic/LaplacianMatrix.cpp 2025-09-04T16:34:32,405 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/NormalizedLaplacianMatrix.o networkit/cpp/algebraic/NormalizedLaplacianMatrix.cpp 2025-09-04T16:34:33,627 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/AdjacencyMatrix.o networkit/cpp/algebraic/AdjacencyMatrix.cpp 2025-09-04T16:34:35,625 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/Vector.o networkit/cpp/algebraic/Vector.cpp 2025-09-04T16:34:38,164 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/IncidenceMatrix.o networkit/cpp/algebraic/IncidenceMatrix.cpp 2025-09-04T16:34:39,670 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/Cover.o networkit/cpp/structures/Cover.cpp 2025-09-04T16:34:39,784 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/UnionFind.o networkit/cpp/structures/UnionFind.cpp 2025-09-04T16:34:41,164 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/Partition.o networkit/cpp/structures/Partition.cpp 2025-09-04T16:34:43,508 networkit/cpp/structures/UnionFind.cpp: In member function ‘NetworKit::Partition NetworKit::UnionFind::toPartition()’: 2025-09-04T16:34:43,509 networkit/cpp/structures/UnionFind.cpp:49:25: warning: moving a local object in a return statement prevents copy elision [-Wpessimizing-move] 2025-09-04T16:34:43,509 49 | return std::move(p); 2025-09-04T16:34:43,510 | ~~~~~~~~~^~~ 2025-09-04T16:34:43,510 networkit/cpp/structures/UnionFind.cpp:49:25: note: remove ‘std::move’ call 2025-09-04T16:34:44,222 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/GraphUpdater.o networkit/cpp/dynamics/GraphUpdater.cpp 2025-09-04T16:34:44,554 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/GraphEventHandler.o networkit/cpp/dynamics/GraphEventHandler.cpp 2025-09-04T16:34:45,570 In file included from /usr/include/c++/14/set:62, 2025-09-04T16:34:45,570 from networkit/cpp/structures/Cover.h:12, 2025-09-04T16:34:45,570 from networkit/cpp/structures/Cover.cpp:8: 2025-09-04T16:34:45,571 /usr/include/c++/14/bits/stl_tree.h: In function ‘std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_emplace_hint_unique(const_iterator, _Args&& ...) [with _Args = {const std::piecewise_construct_t&, std::tuple, std::tuple<>}; _Key = long long unsigned int; _Val = std::pair; _KeyOfValue = std::_Select1st >; _Compare = std::less; _Alloc = std::allocator >]’: 2025-09-04T16:34:45,571 /usr/include/c++/14/bits/stl_tree.h:2456:7: note: parameter passing for argument of type ‘std::_Rb_tree, std::_Select1st >, std::less, std::allocator > >::const_iterator’ changed in GCC 7.1 2025-09-04T16:34:45,571 2456 | _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>:: 2025-09-04T16:34:45,572 | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:46,463 In file included from /usr/include/c++/14/map:63, 2025-09-04T16:34:46,464 from networkit/cpp/structures/Cover.h:14: 2025-09-04T16:34:46,464 In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = long long unsigned int; _Tp = long long unsigned int; _Compare = std::less; _Alloc = std::allocator >]’, 2025-09-04T16:34:46,464 inlined from ‘std::vector NetworKit::Cover::subsetSizes() const’ at networkit/cpp/structures/Cover.cpp:117:14: 2025-09-04T16:34:46,465 /usr/include/c++/14/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree, std::_Select1st >, std::less, std::allocator > >::const_iterator’ changed in GCC 7.1 2025-09-04T16:34:46,465 513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct, 2025-09-04T16:34:46,466 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:46,466 514 | std::tuple(__k), 2025-09-04T16:34:46,466 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:46,466 515 | std::tuple<>()); 2025-09-04T16:34:46,467 | ~~~~~~~~~~~~~~~ 2025-09-04T16:34:46,467 In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = long long unsigned int; _Tp = long long unsigned int; _Compare = std::less; _Alloc = std::allocator >]’, 2025-09-04T16:34:46,467 inlined from ‘std::vector NetworKit::Cover::subsetSizes() const’ at networkit/cpp/structures/Cover.cpp:120:20: 2025-09-04T16:34:46,468 /usr/include/c++/14/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree, std::_Select1st >, std::less, std::allocator > >::const_iterator’ changed in GCC 7.1 2025-09-04T16:34:46,468 513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct, 2025-09-04T16:34:46,468 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:46,469 514 | std::tuple(__k), 2025-09-04T16:34:46,469 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:46,469 515 | std::tuple<>()); 2025-09-04T16:34:46,469 | ~~~~~~~~~~~~~~~ 2025-09-04T16:34:46,626 In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = long long unsigned int; _Tp = long long unsigned int; _Compare = std::less; _Alloc = std::allocator >]’, 2025-09-04T16:34:46,627 inlined from ‘std::map NetworKit::Cover::subsetSizeMap() const’ at networkit/cpp/structures/Cover.cpp:133:14: 2025-09-04T16:34:46,627 /usr/include/c++/14/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree, std::_Select1st >, std::less, std::allocator > >::const_iterator’ changed in GCC 7.1 2025-09-04T16:34:46,627 513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct, 2025-09-04T16:34:46,628 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:46,628 514 | std::tuple(__k), 2025-09-04T16:34:46,628 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:46,628 515 | std::tuple<>()); 2025-09-04T16:34:46,629 | ~~~~~~~~~~~~~~~ 2025-09-04T16:34:46,629 In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = long long unsigned int; _Tp = long long unsigned int; _Compare = std::less; _Alloc = std::allocator >]’, 2025-09-04T16:34:46,629 inlined from ‘std::map NetworKit::Cover::subsetSizeMap() const’ at networkit/cpp/structures/Cover.cpp:135:14: 2025-09-04T16:34:46,629 /usr/include/c++/14/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree, std::_Select1st >, std::less, std::allocator > >::const_iterator’ changed in GCC 7.1 2025-09-04T16:34:46,630 513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct, 2025-09-04T16:34:46,630 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:46,630 514 | std::tuple(__k), 2025-09-04T16:34:46,630 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:46,630 515 | std::tuple<>()); 2025-09-04T16:34:46,631 | ~~~~~~~~~~~~~~~ 2025-09-04T16:34:46,796 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/GraphEventProxy.o networkit/cpp/dynamics/GraphEventProxy.cpp 2025-09-04T16:34:47,712 In file included from /usr/include/c++/14/set:62, 2025-09-04T16:34:47,713 from networkit/cpp/structures/Partition.h:12, 2025-09-04T16:34:47,713 from networkit/cpp/structures/Partition.cpp:8: 2025-09-04T16:34:47,713 /usr/include/c++/14/bits/stl_tree.h: In function ‘std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_emplace_hint_unique(const_iterator, _Args&& ...) [with _Args = {const std::piecewise_construct_t&, std::tuple, std::tuple<>}; _Key = long long unsigned int; _Val = std::pair; _KeyOfValue = std::_Select1st >; _Compare = std::less; _Alloc = std::allocator >]’: 2025-09-04T16:34:47,713 /usr/include/c++/14/bits/stl_tree.h:2456:7: note: parameter passing for argument of type ‘std::_Rb_tree, std::_Select1st >, std::less, std::allocator > >::const_iterator’ changed in GCC 7.1 2025-09-04T16:34:47,714 2456 | _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>:: 2025-09-04T16:34:47,714 | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:47,882 In file included from /usr/include/c++/14/map:63, 2025-09-04T16:34:47,883 from networkit/cpp/structures/Partition.h:14: 2025-09-04T16:34:47,883 In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = long long unsigned int; _Tp = long long unsigned int; _Compare = std::less; _Alloc = std::allocator >]’, 2025-09-04T16:34:47,883 inlined from ‘NetworKit::Partition::compact()::’ at networkit/cpp/structures/Partition.cpp:93:29, 2025-09-04T16:34:47,883 inlined from ‘_ZNK9NetworKit9Partition18parallelForEntriesIZNS0_7compactEvEUlyyE0_EEvT_._omp_fn.0’ at networkit/cpp/structures/Partition.h:355:9: 2025-09-04T16:34:47,884 /usr/include/c++/14/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree, std::_Select1st >, std::less, std::allocator > >::const_iterator’ changed in GCC 7.1 2025-09-04T16:34:47,884 513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct, 2025-09-04T16:34:47,884 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:47,885 514 | std::tuple(__k), 2025-09-04T16:34:47,885 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:47,886 515 | std::tuple<>()); 2025-09-04T16:34:47,886 | ~~~~~~~~~~~~~~~ 2025-09-04T16:34:48,185 networkit/cpp/dynamics/GraphUpdater.cpp: In member function ‘void NetworKit::GraphUpdater::update(std::vector&)’: 2025-09-04T16:34:48,186 networkit/cpp/dynamics/GraphUpdater.cpp:21:38: warning: unused variable ‘u’ [-Wunused-variable] 2025-09-04T16:34:48,186 21 | node u = G.addNode(); 2025-09-04T16:34:48,187 | ^ 2025-09-04T16:34:48,230 In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = long long unsigned int; _Tp = long long unsigned int; _Compare = std::less; _Alloc = std::allocator >]’, 2025-09-04T16:34:48,230 inlined from ‘NetworKit::Partition::subsetSizeMap() const::’ at networkit/cpp/structures/Partition.cpp:113:17, 2025-09-04T16:34:48,231 inlined from ‘void NetworKit::Partition::forEntries(Callback) const [with Callback = NetworKit::Partition::subsetSizeMap() const::]’ at networkit/cpp/structures/Partition.h:347:9, 2025-09-04T16:34:48,231 inlined from ‘std::map NetworKit::Partition::subsetSizeMap() const’ at networkit/cpp/structures/Partition.cpp:111:18: 2025-09-04T16:34:48,231 /usr/include/c++/14/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree, std::_Select1st >, std::less, std::allocator > >::const_iterator’ changed in GCC 7.1 2025-09-04T16:34:48,231 513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct, 2025-09-04T16:34:48,232 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:48,232 514 | std::tuple(__k), 2025-09-04T16:34:48,232 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:48,232 515 | std::tuple<>()); 2025-09-04T16:34:48,232 | ~~~~~~~~~~~~~~~ 2025-09-04T16:34:48,831 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/GraphEventGenerator.o networkit/cpp/dynamics/GraphEventGenerator.cpp 2025-09-04T16:34:48,860 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/GraphEventSource.o networkit/cpp/dynamics/GraphEventSource.cpp 2025-09-04T16:34:48,971 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/DGSStreamParser.o networkit/cpp/dynamics/DGSStreamParser.cpp 2025-09-04T16:34:51,502 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/DGSWriter.o networkit/cpp/dynamics/DGSWriter.cpp 2025-09-04T16:34:52,936 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/GraphEvent.o networkit/cpp/dynamics/GraphEvent.cpp 2025-09-04T16:34:52,963 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/GraphEventTarget.o networkit/cpp/dynamics/GraphEventTarget.cpp 2025-09-04T16:34:54,458 In file included from /usr/include/c++/14/map:62, 2025-09-04T16:34:54,458 from networkit/cpp/dynamics/DGSStreamParser.h:13, 2025-09-04T16:34:54,459 from networkit/cpp/dynamics/DGSStreamParser.cpp:8: 2025-09-04T16:34:54,459 /usr/include/c++/14/bits/stl_tree.h: In function ‘std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_emplace_hint_unique(const_iterator, _Args&& ...) [with _Args = {const std::piecewise_construct_t&, std::tuple, std::allocator >&>, std::tuple<>}; _Key = std::__cxx11::basic_string; _Val = std::pair, long long unsigned int>; _KeyOfValue = std::_Select1st, long long unsigned int> >; _Compare = std::less >; _Alloc = std::allocator, long long unsigned int> >]’: 2025-09-04T16:34:54,459 /usr/include/c++/14/bits/stl_tree.h:2456:7: note: parameter passing for argument of type ‘std::_Rb_tree, std::pair, long long unsigned int>, std::_Select1st, long long unsigned int> >, std::less >, std::allocator, long long unsigned int> > >::const_iterator’ changed in GCC 7.1 2025-09-04T16:34:54,459 2456 | _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>:: 2025-09-04T16:34:54,460 | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:54,633 In file included from /usr/include/c++/14/map:63: 2025-09-04T16:34:54,633 In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string; _Tp = long long unsigned int; _Compare = std::less >; _Alloc = std::allocator, long long unsigned int> >]’, 2025-09-04T16:34:54,633 inlined from ‘NetworKit::DGSStreamParser::getStream()::’ at networkit/cpp/dynamics/DGSStreamParser.cpp:49:15: 2025-09-04T16:34:54,634 /usr/include/c++/14/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree, std::pair, long long unsigned int>, std::_Select1st, long long unsigned int> >, std::less >, std::allocator, long long unsigned int> > >::const_iterator’ changed in GCC 7.1 2025-09-04T16:34:54,634 513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct, 2025-09-04T16:34:54,634 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:54,635 514 | std::tuple(__k), 2025-09-04T16:34:54,635 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:54,635 515 | std::tuple<>()); 2025-09-04T16:34:54,635 | ~~~~~~~~~~~~~~~ 2025-09-04T16:34:54,636 In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string; _Tp = long long unsigned int; _Compare = std::less >; _Alloc = std::allocator, long long unsigned int> >]’, 2025-09-04T16:34:54,636 inlined from ‘NetworKit::DGSStreamParser::getStream()::’ at networkit/cpp/dynamics/DGSStreamParser.cpp:51:22: 2025-09-04T16:34:54,636 /usr/include/c++/14/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree, std::pair, long long unsigned int>, std::_Select1st, long long unsigned int> >, std::less >, std::allocator, long long unsigned int> > >::const_iterator’ changed in GCC 7.1 2025-09-04T16:34:54,636 513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct, 2025-09-04T16:34:54,637 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:54,637 514 | std::tuple(__k), 2025-09-04T16:34:54,637 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:54,637 515 | std::tuple<>()); 2025-09-04T16:34:54,637 | ~~~~~~~~~~~~~~~ 2025-09-04T16:34:56,618 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/StaticGraphGenerator.o networkit/cpp/generators/StaticGraphGenerator.cpp 2025-09-04T16:34:56,631 In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string; _Tp = long long unsigned int; _Compare = std::less >; _Alloc = std::allocator, long long unsigned int> >]’, 2025-09-04T16:34:56,632 inlined from ‘NetworKit::DGSStreamParser::getStream()::’ at networkit/cpp/dynamics/DGSStreamParser.cpp:49:15, 2025-09-04T16:34:56,632 inlined from ‘std::vector NetworKit::DGSStreamParser::getStream()’ at networkit/cpp/dynamics/DGSStreamParser.cpp:70:17: 2025-09-04T16:34:56,632 /usr/include/c++/14/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree, std::pair, long long unsigned int>, std::_Select1st, long long unsigned int> >, std::less >, std::allocator, long long unsigned int> > >::const_iterator’ changed in GCC 7.1 2025-09-04T16:34:56,633 513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct, 2025-09-04T16:34:56,633 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:56,633 514 | std::tuple(__k), 2025-09-04T16:34:56,633 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:56,634 515 | std::tuple<>()); 2025-09-04T16:34:56,634 | ~~~~~~~~~~~~~~~ 2025-09-04T16:34:56,634 In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string; _Tp = long long unsigned int; _Compare = std::less >; _Alloc = std::allocator, long long unsigned int> >]’, 2025-09-04T16:34:56,634 inlined from ‘NetworKit::DGSStreamParser::getStream()::’ at networkit/cpp/dynamics/DGSStreamParser.cpp:51:22, 2025-09-04T16:34:56,635 inlined from ‘std::vector NetworKit::DGSStreamParser::getStream()’ at networkit/cpp/dynamics/DGSStreamParser.cpp:70:17: 2025-09-04T16:34:56,635 /usr/include/c++/14/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree, std::pair, long long unsigned int>, std::_Select1st, long long unsigned int> >, std::less >, std::allocator, long long unsigned int> > >::const_iterator’ changed in GCC 7.1 2025-09-04T16:34:56,635 513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct, 2025-09-04T16:34:56,635 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:56,635 514 | std::tuple(__k), 2025-09-04T16:34:56,636 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:56,636 515 | std::tuple<>()); 2025-09-04T16:34:56,636 | ~~~~~~~~~~~~~~~ 2025-09-04T16:34:56,636 In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string; _Tp = long long unsigned int; _Compare = std::less >; _Alloc = std::allocator, long long unsigned int> >]’, 2025-09-04T16:34:56,637 inlined from ‘NetworKit::DGSStreamParser::getStream()::’ at networkit/cpp/dynamics/DGSStreamParser.cpp:49:15, 2025-09-04T16:34:56,637 inlined from ‘std::vector NetworKit::DGSStreamParser::getStream()’ at networkit/cpp/dynamics/DGSStreamParser.cpp:75:17: 2025-09-04T16:34:56,637 /usr/include/c++/14/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree, std::pair, long long unsigned int>, std::_Select1st, long long unsigned int> >, std::less >, std::allocator, long long unsigned int> > >::const_iterator’ changed in GCC 7.1 2025-09-04T16:34:56,637 513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct, 2025-09-04T16:34:56,638 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:56,638 514 | std::tuple(__k), 2025-09-04T16:34:56,638 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:56,638 515 | std::tuple<>()); 2025-09-04T16:34:56,638 | ~~~~~~~~~~~~~~~ 2025-09-04T16:34:56,639 In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string; _Tp = long long unsigned int; _Compare = std::less >; _Alloc = std::allocator, long long unsigned int> >]’, 2025-09-04T16:34:56,639 inlined from ‘NetworKit::DGSStreamParser::getStream()::’ at networkit/cpp/dynamics/DGSStreamParser.cpp:51:22, 2025-09-04T16:34:56,639 inlined from ‘std::vector NetworKit::DGSStreamParser::getStream()’ at networkit/cpp/dynamics/DGSStreamParser.cpp:75:17: 2025-09-04T16:34:56,639 /usr/include/c++/14/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree, std::pair, long long unsigned int>, std::_Select1st, long long unsigned int> >, std::less >, std::allocator, long long unsigned int> > >::const_iterator’ changed in GCC 7.1 2025-09-04T16:34:56,640 513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct, 2025-09-04T16:34:56,640 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:56,640 514 | std::tuple(__k), 2025-09-04T16:34:56,640 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:56,640 515 | std::tuple<>()); 2025-09-04T16:34:56,641 | ~~~~~~~~~~~~~~~ 2025-09-04T16:34:56,641 In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string; _Tp = long long unsigned int; _Compare = std::less >; _Alloc = std::allocator, long long unsigned int> >]’, 2025-09-04T16:34:56,641 inlined from ‘NetworKit::DGSStreamParser::getStream()::’ at networkit/cpp/dynamics/DGSStreamParser.cpp:49:15, 2025-09-04T16:34:56,641 inlined from ‘std::vector NetworKit::DGSStreamParser::getStream()’ at networkit/cpp/dynamics/DGSStreamParser.cpp:76:17: 2025-09-04T16:34:56,652 /usr/include/c++/14/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree, std::pair, long long unsigned int>, std::_Select1st, long long unsigned int> >, std::less >, std::allocator, long long unsigned int> > >::const_iterator’ changed in GCC 7.1 2025-09-04T16:34:56,652 513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct, 2025-09-04T16:34:56,652 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:56,653 514 | std::tuple(__k), 2025-09-04T16:34:56,653 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:56,653 515 | std::tuple<>()); 2025-09-04T16:34:56,653 | ~~~~~~~~~~~~~~~ 2025-09-04T16:34:56,654 In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string; _Tp = long long unsigned int; _Compare = std::less >; _Alloc = std::allocator, long long unsigned int> >]’, 2025-09-04T16:34:56,654 inlined from ‘NetworKit::DGSStreamParser::getStream()::’ at networkit/cpp/dynamics/DGSStreamParser.cpp:51:22, 2025-09-04T16:34:56,654 inlined from ‘std::vector NetworKit::DGSStreamParser::getStream()’ at networkit/cpp/dynamics/DGSStreamParser.cpp:76:17: 2025-09-04T16:34:56,654 /usr/include/c++/14/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree, std::pair, long long unsigned int>, std::_Select1st, long long unsigned int> >, std::less >, std::allocator, long long unsigned int> > >::const_iterator’ changed in GCC 7.1 2025-09-04T16:34:56,655 513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct, 2025-09-04T16:34:56,655 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:56,655 514 | std::tuple(__k), 2025-09-04T16:34:56,655 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:56,656 515 | std::tuple<>()); 2025-09-04T16:34:56,656 | ~~~~~~~~~~~~~~~ 2025-09-04T16:34:56,656 In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string; _Tp = long long unsigned int; _Compare = std::less >; _Alloc = std::allocator, long long unsigned int> >]’, 2025-09-04T16:34:56,656 inlined from ‘NetworKit::DGSStreamParser::getStream()::’ at networkit/cpp/dynamics/DGSStreamParser.cpp:49:15, 2025-09-04T16:34:56,657 inlined from ‘std::vector NetworKit::DGSStreamParser::getStream()’ at networkit/cpp/dynamics/DGSStreamParser.cpp:87:17: 2025-09-04T16:34:56,657 /usr/include/c++/14/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree, std::pair, long long unsigned int>, std::_Select1st, long long unsigned int> >, std::less >, std::allocator, long long unsigned int> > >::const_iterator’ changed in GCC 7.1 2025-09-04T16:34:56,657 513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct, 2025-09-04T16:34:56,657 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:56,657 514 | std::tuple(__k), 2025-09-04T16:34:56,657 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:56,658 515 | std::tuple<>()); 2025-09-04T16:34:56,658 | ~~~~~~~~~~~~~~~ 2025-09-04T16:34:56,658 In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string; _Tp = long long unsigned int; _Compare = std::less >; _Alloc = std::allocator, long long unsigned int> >]’, 2025-09-04T16:34:56,658 inlined from ‘NetworKit::DGSStreamParser::getStream()::’ at networkit/cpp/dynamics/DGSStreamParser.cpp:51:22, 2025-09-04T16:34:56,658 inlined from ‘std::vector NetworKit::DGSStreamParser::getStream()’ at networkit/cpp/dynamics/DGSStreamParser.cpp:87:17: 2025-09-04T16:34:56,659 /usr/include/c++/14/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree, std::pair, long long unsigned int>, std::_Select1st, long long unsigned int> >, std::less >, std::allocator, long long unsigned int> > >::const_iterator’ changed in GCC 7.1 2025-09-04T16:34:56,659 513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct, 2025-09-04T16:34:56,659 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:56,659 514 | std::tuple(__k), 2025-09-04T16:34:56,660 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:56,660 515 | std::tuple<>()); 2025-09-04T16:34:56,660 | ~~~~~~~~~~~~~~~ 2025-09-04T16:34:56,660 In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string; _Tp = long long unsigned int; _Compare = std::less >; _Alloc = std::allocator, long long unsigned int> >]’, 2025-09-04T16:34:56,661 inlined from ‘NetworKit::DGSStreamParser::getStream()::’ at networkit/cpp/dynamics/DGSStreamParser.cpp:49:15, 2025-09-04T16:34:56,661 inlined from ‘std::vector NetworKit::DGSStreamParser::getStream()’ at networkit/cpp/dynamics/DGSStreamParser.cpp:100:17: 2025-09-04T16:34:56,661 /usr/include/c++/14/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree, std::pair, long long unsigned int>, std::_Select1st, long long unsigned int> >, std::less >, std::allocator, long long unsigned int> > >::const_iterator’ changed in GCC 7.1 2025-09-04T16:34:56,672 513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct, 2025-09-04T16:34:56,672 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:56,672 514 | std::tuple(__k), 2025-09-04T16:34:56,672 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:56,673 515 | std::tuple<>()); 2025-09-04T16:34:56,673 | ~~~~~~~~~~~~~~~ 2025-09-04T16:34:56,673 In member function ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](const key_type&) [with _Key = std::__cxx11::basic_string; _Tp = long long unsigned int; _Compare = std::less >; _Alloc = std::allocator, long long unsigned int> >]’, 2025-09-04T16:34:56,673 inlined from ‘NetworKit::DGSStreamParser::getStream()::’ at networkit/cpp/dynamics/DGSStreamParser.cpp:51:22, 2025-09-04T16:34:56,674 inlined from ‘std::vector NetworKit::DGSStreamParser::getStream()’ at networkit/cpp/dynamics/DGSStreamParser.cpp:100:17: 2025-09-04T16:34:56,674 /usr/include/c++/14/bits/stl_map.h:513:44: note: parameter passing for argument of type ‘std::_Rb_tree, std::pair, long long unsigned int>, std::_Select1st, long long unsigned int> >, std::less >, std::allocator, long long unsigned int> > >::const_iterator’ changed in GCC 7.1 2025-09-04T16:34:56,674 513 | __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct, 2025-09-04T16:34:56,675 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:56,675 514 | std::tuple(__k), 2025-09-04T16:34:56,675 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:34:56,675 515 | std::tuple<>()); 2025-09-04T16:34:56,675 | ~~~~~~~~~~~~~~~ 2025-09-04T16:34:57,346 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/PubWebGenerator.o networkit/cpp/generators/PubWebGenerator.cpp 2025-09-04T16:34:57,616 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/StochasticBlockmodel.o networkit/cpp/generators/StochasticBlockmodel.cpp 2025-09-04T16:34:58,410 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/ErdosRenyiGenerator.o networkit/cpp/generators/ErdosRenyiGenerator.cpp 2025-09-04T16:35:01,070 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/PowerlawDegreeSequence.o networkit/cpp/generators/PowerlawDegreeSequence.cpp 2025-09-04T16:35:02,728 In file included from /usr/include/c++/14/queue:64, 2025-09-04T16:35:02,728 from networkit/cpp/generators/PubWebGenerator.cpp:9: 2025-09-04T16:35:02,729 /usr/include/c++/14/bits/stl_heap.h: In function ‘void std::__push_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator >*, vector >, allocator > > > >; _Distance = int; _Tp = pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_val > > >]’: 2025-09-04T16:35:02,729 /usr/include/c++/14/bits/stl_heap.h:135:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >’ changed in GCC 7.1 2025-09-04T16:35:02,729 135 | __push_heap(_RandomAccessIterator __first, 2025-09-04T16:35:02,729 | ^~~~~~~~~~~ 2025-09-04T16:35:02,833 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/DynamicForestFireGenerator.o networkit/cpp/generators/DynamicForestFireGenerator.cpp 2025-09-04T16:35:03,244 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/BarabasiAlbertGenerator.o networkit/cpp/generators/BarabasiAlbertGenerator.cpp 2025-09-04T16:35:04,079 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/DynamicDorogovtsevMendesGenerator.o networkit/cpp/generators/DynamicDorogovtsevMendesGenerator.cpp 2025-09-04T16:35:05,978 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/ClusteredRandomGraphGenerator.o networkit/cpp/generators/ClusteredRandomGraphGenerator.cpp 2025-09-04T16:35:08,627 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/ChungLuGenerator.o networkit/cpp/generators/ChungLuGenerator.cpp 2025-09-04T16:35:09,688 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/DynamicPathGenerator.o networkit/cpp/generators/DynamicPathGenerator.cpp 2025-09-04T16:35:11,531 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/DynamicPubWebGenerator.o networkit/cpp/generators/DynamicPubWebGenerator.cpp 2025-09-04T16:35:12,654 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/DynamicDGSParser.o networkit/cpp/generators/DynamicDGSParser.cpp 2025-09-04T16:35:13,456 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/RmatGenerator.o networkit/cpp/generators/RmatGenerator.cpp 2025-09-04T16:35:14,898 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/RegularRingLatticeGenerator.o networkit/cpp/generators/RegularRingLatticeGenerator.cpp 2025-09-04T16:35:18,276 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/WattsStrogatzGenerator.o networkit/cpp/generators/WattsStrogatzGenerator.cpp 2025-09-04T16:35:18,552 In file included from /usr/include/c++/14/queue:64, 2025-09-04T16:35:18,552 from networkit/cpp/generators/DynamicPubWebGenerator.cpp:8: 2025-09-04T16:35:18,552 /usr/include/c++/14/bits/stl_heap.h: In function ‘void std::__push_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator >*, vector >, allocator > > > >; _Distance = int; _Tp = pair >; _Compare = __gnu_cxx::__ops::_Iter_comp_val > > >]’: 2025-09-04T16:35:18,553 /usr/include/c++/14/bits/stl_heap.h:135:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator >*, std::vector >, std::allocator > > > >’ changed in GCC 7.1 2025-09-04T16:35:18,554 135 | __push_heap(_RandomAccessIterator __first, 2025-09-04T16:35:18,554 | ^~~~~~~~~~~ 2025-09-04T16:35:19,755 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/DynamicBarabasiAlbertGenerator.o networkit/cpp/generators/DynamicBarabasiAlbertGenerator.cpp 2025-09-04T16:35:21,595 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/DynamicGraphSource.o networkit/cpp/generators/DynamicGraphSource.cpp 2025-09-04T16:35:23,781 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/DorogovtsevMendesGenerator.o networkit/cpp/generators/DorogovtsevMendesGenerator.cpp 2025-09-04T16:35:23,972 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/HavelHakimiGenerator.o networkit/cpp/generators/HavelHakimiGenerator.cpp 2025-09-04T16:35:24,724 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/ConfigurationModelGenerator.o networkit/cpp/generators/ConfigurationModelGenerator.cpp 2025-09-04T16:35:25,932 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/StaticDegreeSequenceGenerator.o networkit/cpp/generators/StaticDegreeSequenceGenerator.cpp 2025-09-04T16:35:28,559 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/DynamicGraphGenerator.o networkit/cpp/generators/DynamicGraphGenerator.cpp 2025-09-04T16:35:30,247 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/Parameters.o networkit/cpp/base/Parameters.cpp 2025-09-04T16:35:30,311 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/RegionGrowingOverlapper.o networkit/cpp/overlap/RegionGrowingOverlapper.cpp 2025-09-04T16:35:30,532 In file included from /usr/include/c++/14/bits/stl_algo.h:61, 2025-09-04T16:35:30,533 from /usr/include/c++/14/algorithm:61, 2025-09-04T16:35:30,533 from networkit/cpp/generators/../graph/Graph.h:11, 2025-09-04T16:35:30,533 from networkit/cpp/generators/StaticGraphGenerator.h:11, 2025-09-04T16:35:30,533 from networkit/cpp/generators/StaticDegreeSequenceGenerator.h:11, 2025-09-04T16:35:30,534 from networkit/cpp/generators/StaticDegreeSequenceGenerator.cpp:8: 2025-09-04T16:35:30,534 /usr/include/c++/14/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator >; _Distance = int; _Tp = long long unsigned int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter >]’: 2025-09-04T16:35:30,534 /usr/include/c++/14/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator >’ changed in GCC 7.1 2025-09-04T16:35:30,534 224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex, 2025-09-04T16:35:30,535 | ^~~~~~~~~~~~~ 2025-09-04T16:35:30,586 /usr/include/c++/14/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter >]’: 2025-09-04T16:35:30,586 /usr/include/c++/14/bits/stl_algo.h:1770:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator >’ changed in GCC 7.1 2025-09-04T16:35:30,587 1770 | __insertion_sort(_RandomAccessIterator __first, 2025-09-04T16:35:30,587 | ^~~~~~~~~~~~~~~~ 2025-09-04T16:35:30,588 /usr/include/c++/14/bits/stl_algo.h:1770:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator >’ changed in GCC 7.1 2025-09-04T16:35:30,704 /usr/include/c++/14/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter >]’: 2025-09-04T16:35:30,705 /usr/include/c++/14/bits/stl_algo.h:1876:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator >’ changed in GCC 7.1 2025-09-04T16:35:30,705 1876 | __introsort_loop(_RandomAccessIterator __first, 2025-09-04T16:35:30,705 | ^~~~~~~~~~~~~~~~ 2025-09-04T16:35:30,706 /usr/include/c++/14/bits/stl_algo.h:1876:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator >’ changed in GCC 7.1 2025-09-04T16:35:30,706 /usr/include/c++/14/bits/stl_algo.h:1890:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator >’ changed in GCC 7.1 2025-09-04T16:35:30,706 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); 2025-09-04T16:35:30,706 | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:35:30,854 In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter >]’, 2025-09-04T16:35:30,854 inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator >; _Compare = greater]’ at /usr/include/c++/14/bits/stl_algo.h:4805:18, 2025-09-04T16:35:30,854 inlined from ‘virtual bool NetworKit::StaticDegreeSequenceGenerator::isRealizable()’ at networkit/cpp/generators/StaticDegreeSequenceGenerator.cpp:48:11: 2025-09-04T16:35:30,855 /usr/include/c++/14/bits/stl_algo.h:1905:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator >’ changed in GCC 7.1 2025-09-04T16:35:30,855 1905 | std::__introsort_loop(__first, __last, 2025-09-04T16:35:30,855 | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 2025-09-04T16:35:30,856 1906 | std::__lg(__last - __first) * 2, 2025-09-04T16:35:30,856 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:35:30,856 1907 | __comp); 2025-09-04T16:35:30,856 | ~~~~~~~ 2025-09-04T16:35:30,856 In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter >]’, 2025-09-04T16:35:30,856 inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter >]’ at /usr/include/c++/14/bits/stl_algo.h:1908:31, 2025-09-04T16:35:30,857 inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator >; _Compare = greater]’ at /usr/include/c++/14/bits/stl_algo.h:4805:18, 2025-09-04T16:35:30,857 inlined from ‘virtual bool NetworKit::StaticDegreeSequenceGenerator::isRealizable()’ at networkit/cpp/generators/StaticDegreeSequenceGenerator.cpp:48:11: 2025-09-04T16:35:30,857 /usr/include/c++/14/bits/stl_algo.h:1817:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator >’ changed in GCC 7.1 2025-09-04T16:35:30,858 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); 2025-09-04T16:35:30,858 | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:35:30,858 /usr/include/c++/14/bits/stl_algo.h:1822:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator >’ changed in GCC 7.1 2025-09-04T16:35:30,858 1822 | std::__insertion_sort(__first, __last, __comp); 2025-09-04T16:35:30,858 | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:35:30,940 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/Overlapper.o networkit/cpp/overlap/Overlapper.cpp 2025-09-04T16:35:32,788 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/HashingOverlapper.o networkit/cpp/overlap/HashingOverlapper.cpp 2025-09-04T16:35:33,841 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/Diameter.o networkit/cpp/properties/Diameter.cpp 2025-09-04T16:35:35,210 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/ParallelConnectedComponents.o networkit/cpp/properties/ParallelConnectedComponents.cpp 2025-09-04T16:35:37,115 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/CoreDecomposition.o networkit/cpp/properties/CoreDecomposition.cpp 2025-09-04T16:35:37,892 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/ConnectedComponents.o networkit/cpp/properties/ConnectedComponents.cpp 2025-09-04T16:35:41,048 In file included from /usr/include/c++/14/vector:72, 2025-09-04T16:35:41,048 from networkit/cpp/properties/../graph/Graph.h:12, 2025-09-04T16:35:41,049 from networkit/cpp/properties/Diameter.h:11, 2025-09-04T16:35:41,049 from networkit/cpp/properties/Diameter.cpp:10: 2025-09-04T16:35:41,049 /usr/include/c++/14/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::_M_fill_insert(iterator, size_type, const value_type&) [with _Tp = long long unsigned int; _Alloc = std::allocator]’: 2025-09-04T16:35:41,049 /usr/include/c++/14/bits/vector.tcc:700:5: note: parameter passing for argument of type ‘std::vector::iterator’ changed in GCC 7.1 2025-09-04T16:35:41,049 700 | vector<_Tp, _Alloc>:: 2025-09-04T16:35:41,049 | ^~~~~~~~~~~~~~~~~~~ 2025-09-04T16:35:42,782 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/StronglyConnectedComponents.o networkit/cpp/properties/StronglyConnectedComponents.cpp 2025-09-04T16:35:43,107 In file included from /usr/include/c++/14/vector:66: 2025-09-04T16:35:43,107 In member function ‘void std::vector<_Tp, _Alloc>::resize(size_type, const value_type&) [with _Tp = long long unsigned int; _Alloc = std::allocator]’, 2025-09-04T16:35:43,107 inlined from ‘static std::pair NetworKit::Diameter::estimatedDiameterRange(const NetworKit::Graph&, double, std::pair*)’ at networkit/cpp/properties/Diameter.cpp:67:20: 2025-09-04T16:35:43,107 /usr/include/c++/14/bits/stl_vector.h:1037:25: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator >’ changed in GCC 7.1 2025-09-04T16:35:43,108 1037 | _M_fill_insert(end(), __new_size - size(), __x); 2025-09-04T16:35:43,108 | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:35:43,807 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/GlobalClusteringCoefficient.o networkit/cpp/properties/GlobalClusteringCoefficient.cpp 2025-09-04T16:35:43,954 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/ClusteringCoefficient.o networkit/cpp/properties/ClusteringCoefficient.cpp 2025-09-04T16:35:47,398 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/Eccentricity.o networkit/cpp/properties/Eccentricity.cpp 2025-09-04T16:35:48,445 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/GraphProperties.o networkit/cpp/properties/GraphProperties.cpp 2025-09-04T16:35:48,783 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/TAlgebraicDistance.o networkit/cpp/distmeasures/TAlgebraicDistance.cpp 2025-09-04T16:35:53,162 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/NeighborhoodDistance.o networkit/cpp/distmeasures/NeighborhoodDistance.cpp 2025-09-04T16:35:53,769 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/TNeighborhoodDistance.o networkit/cpp/distmeasures/TNeighborhoodDistance.cpp 2025-09-04T16:35:55,138 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/NodeDistance.o networkit/cpp/distmeasures/NodeDistance.cpp 2025-09-04T16:35:56,550 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/AlgebraicDistance.o networkit/cpp/distmeasures/AlgebraicDistance.cpp 2025-09-04T16:35:57,902 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/TNodeDistance.o networkit/cpp/distmeasures/TNodeDistance.cpp 2025-09-04T16:35:58,612 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/DynApproxBetweenness.o networkit/cpp/centrality/DynApproxBetweenness.cpp 2025-09-04T16:35:59,309 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/ApproxBetweenness2.o networkit/cpp/centrality/ApproxBetweenness2.cpp 2025-09-04T16:36:02,496 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/DegreeCentrality.o networkit/cpp/centrality/DegreeCentrality.cpp 2025-09-04T16:36:02,663 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/EigenvectorCentrality.o networkit/cpp/centrality/EigenvectorCentrality.cpp 2025-09-04T16:36:05,396 In file included from /usr/include/c++/14/bits/stl_algo.h:61, 2025-09-04T16:36:05,397 from /usr/include/c++/14/algorithm:61, 2025-09-04T16:36:05,397 from networkit/cpp/centrality/../graph/Graph.h:11, 2025-09-04T16:36:05,397 from networkit/cpp/centrality/Centrality.h:11, 2025-09-04T16:36:05,397 from networkit/cpp/centrality/ApproxBetweenness2.h:11, 2025-09-04T16:36:05,397 from networkit/cpp/centrality/ApproxBetweenness2.cpp:9: 2025-09-04T16:36:05,398 /usr/include/c++/14/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator >; _Distance = int; _Tp = long long unsigned int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter >]’: 2025-09-04T16:36:05,398 /usr/include/c++/14/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator >’ changed in GCC 7.1 2025-09-04T16:36:05,398 224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex, 2025-09-04T16:36:05,398 | ^~~~~~~~~~~~~ 2025-09-04T16:36:05,591 /usr/include/c++/14/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter >]’: 2025-09-04T16:36:05,591 /usr/include/c++/14/bits/stl_algo.h:1876:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator >’ changed in GCC 7.1 2025-09-04T16:36:05,592 1876 | __introsort_loop(_RandomAccessIterator __first, 2025-09-04T16:36:05,592 | ^~~~~~~~~~~~~~~~ 2025-09-04T16:36:05,592 /usr/include/c++/14/bits/stl_algo.h:1876:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator >’ changed in GCC 7.1 2025-09-04T16:36:05,594 /usr/include/c++/14/bits/stl_algo.h:1890:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator >’ changed in GCC 7.1 2025-09-04T16:36:05,594 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); 2025-09-04T16:36:05,594 | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:36:05,599 In file included from networkit/cpp/centrality/../graph/../ext/ttmath/ttmathint.h:48, 2025-09-04T16:36:05,599 from networkit/cpp/centrality/../graph/../ext/ttmath/ttmathbig.h:46, 2025-09-04T16:36:05,599 from networkit/cpp/centrality/../graph/../ext/ttmath/ttmath.h:58, 2025-09-04T16:36:05,600 from networkit/cpp/centrality/../graph/../Globals.h:15, 2025-09-04T16:36:05,600 from networkit/cpp/centrality/../graph/Graph.h:19, 2025-09-04T16:36:05,600 from networkit/cpp/centrality/Centrality.h:11, 2025-09-04T16:36:05,600 from networkit/cpp/centrality/DynApproxBetweenness.h:11, 2025-09-04T16:36:05,600 from networkit/cpp/centrality/DynApproxBetweenness.cpp:8: 2025-09-04T16:36:05,601 In member function ‘void ttmath::UInt::Div3_Division(ttmath::UInt, ttmath::UInt*, ttmath::uint, ttmath::uint) [with unsigned int value_size = 2]’, 2025-09-04T16:36:05,601 inlined from ‘ttmath::uint ttmath::UInt::Div3Ref(const ttmath::UInt&, ttmath::UInt*) [with unsigned int value_size = 2]’ at networkit/cpp/centrality/../graph/../ext/ttmath/ttmathuint.h:2148:16: 2025-09-04T16:36:05,601 networkit/cpp/centrality/../graph/../ext/ttmath/ttmathuint.h:2193:32: warning: array subscript 4294967294 is above array bounds of ‘ttmath::uint [2]’ {aka ‘unsigned int [2]’} [-Warray-bounds=] 2025-09-04T16:36:05,601 2193 | q.table[j] = qp; 2025-09-04T16:36:05,602 | ~~~~~~~^ 2025-09-04T16:36:05,602 networkit/cpp/centrality/../graph/../ext/ttmath/ttmathuint.h: In function ‘ttmath::uint ttmath::UInt::Div3Ref(const ttmath::UInt&, ttmath::UInt*) [with unsigned int value_size = 2]’: 2025-09-04T16:36:05,602 networkit/cpp/centrality/../graph/../ext/ttmath/ttmathuint.h:81:14: note: while referencing ‘ttmath::UInt<2>::table’ 2025-09-04T16:36:05,602 81 | uint table[value_size]; 2025-09-04T16:36:05,602 | ^~~~~ 2025-09-04T16:36:05,677 /usr/include/c++/14/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter >]’: 2025-09-04T16:36:05,677 /usr/include/c++/14/bits/stl_algo.h:1770:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator >’ changed in GCC 7.1 2025-09-04T16:36:05,677 1770 | __insertion_sort(_RandomAccessIterator __first, 2025-09-04T16:36:05,677 | ^~~~~~~~~~~~~~~~ 2025-09-04T16:36:05,678 /usr/include/c++/14/bits/stl_algo.h:1770:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator >’ changed in GCC 7.1 2025-09-04T16:36:05,838 In file included from networkit/cpp/centrality/../graph/../ext/ttmath/ttmathint.h:48, 2025-09-04T16:36:05,839 from networkit/cpp/centrality/../graph/../ext/ttmath/ttmathbig.h:46, 2025-09-04T16:36:05,839 from networkit/cpp/centrality/../graph/../ext/ttmath/ttmath.h:58, 2025-09-04T16:36:05,839 from networkit/cpp/centrality/../graph/../Globals.h:15, 2025-09-04T16:36:05,839 from networkit/cpp/centrality/../graph/Graph.h:19: 2025-09-04T16:36:05,840 In member function ‘void ttmath::UInt::Div3_Division(ttmath::UInt, ttmath::UInt*, ttmath::uint, ttmath::uint) [with unsigned int value_size = 2]’, 2025-09-04T16:36:05,840 inlined from ‘ttmath::uint ttmath::UInt::Div3Ref(const ttmath::UInt&, ttmath::UInt*) [with unsigned int value_size = 2]’ at networkit/cpp/centrality/../graph/../ext/ttmath/ttmathuint.h:2148:16: 2025-09-04T16:36:05,840 networkit/cpp/centrality/../graph/../ext/ttmath/ttmathuint.h:2193:32: warning: array subscript 4294967294 is above array bounds of ‘ttmath::uint [2]’ {aka ‘unsigned int [2]’} [-Warray-bounds=] 2025-09-04T16:36:05,840 2193 | q.table[j] = qp; 2025-09-04T16:36:05,840 | ~~~~~~~^ 2025-09-04T16:36:05,841 networkit/cpp/centrality/../graph/../ext/ttmath/ttmathuint.h: In function ‘ttmath::uint ttmath::UInt::Div3Ref(const ttmath::UInt&, ttmath::UInt*) [with unsigned int value_size = 2]’: 2025-09-04T16:36:05,842 networkit/cpp/centrality/../graph/../ext/ttmath/ttmathuint.h:81:14: note: while referencing ‘ttmath::UInt<2>::table’ 2025-09-04T16:36:05,842 81 | uint table[value_size]; 2025-09-04T16:36:05,842 | ^~~~~ 2025-09-04T16:36:06,832 In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter >]’, 2025-09-04T16:36:06,833 inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator >; _Compare = NetworKit::ApproxBetweenness2::run()::]’ at /usr/include/c++/14/bits/stl_algo.h:4805:18, 2025-09-04T16:36:06,833 inlined from ‘virtual void NetworKit::ApproxBetweenness2::run()’ at networkit/cpp/centrality/ApproxBetweenness2.cpp:45:12: 2025-09-04T16:36:06,834 /usr/include/c++/14/bits/stl_algo.h:1905:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator >’ changed in GCC 7.1 2025-09-04T16:36:06,834 1905 | std::__introsort_loop(__first, __last, 2025-09-04T16:36:06,834 | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 2025-09-04T16:36:06,834 1906 | std::__lg(__last - __first) * 2, 2025-09-04T16:36:06,835 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:36:06,835 1907 | __comp); 2025-09-04T16:36:06,835 | ~~~~~~~ 2025-09-04T16:36:06,836 In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter >]’, 2025-09-04T16:36:06,837 inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter >]’ at /usr/include/c++/14/bits/stl_algo.h:1908:31, 2025-09-04T16:36:06,837 inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator >; _Compare = NetworKit::ApproxBetweenness2::run()::]’ at /usr/include/c++/14/bits/stl_algo.h:4805:18, 2025-09-04T16:36:06,837 inlined from ‘virtual void NetworKit::ApproxBetweenness2::run()’ at networkit/cpp/centrality/ApproxBetweenness2.cpp:45:12: 2025-09-04T16:36:06,838 /usr/include/c++/14/bits/stl_algo.h:1817:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator >’ changed in GCC 7.1 2025-09-04T16:36:06,838 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); 2025-09-04T16:36:06,838 | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:36:06,839 /usr/include/c++/14/bits/stl_algo.h:1822:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator >’ changed in GCC 7.1 2025-09-04T16:36:06,840 1822 | std::__insertion_sort(__first, __last, __comp); 2025-09-04T16:36:06,840 | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:36:07,140 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/ApproxBetweenness.o networkit/cpp/centrality/ApproxBetweenness.cpp 2025-09-04T16:36:07,284 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/DynBetweenness.o networkit/cpp/centrality/DynBetweenness.cpp 2025-09-04T16:36:08,152 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/Centrality.o networkit/cpp/centrality/Centrality.cpp 2025-09-04T16:36:10,928 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/PageRank.o networkit/cpp/centrality/PageRank.cpp 2025-09-04T16:36:13,060 networkit/cpp/centrality/DynBetweenness.cpp: In constructor ‘NetworKit::DynBetweenness::DynBetweenness(const NetworKit::Graph&, bool)’: 2025-09-04T16:36:13,060 networkit/cpp/centrality/DynBetweenness.cpp:26:29: warning: ‘*this.NetworKit::DynBetweenness::NetworKit::Centrality.NetworKit::Centrality::normalized’ is used uninitialized [-Wuninitialized] 2025-09-04T16:36:13,061 26 | storePreds(storePredecessors) { 2025-09-04T16:36:13,061 | ^ 2025-09-04T16:36:13,091 In file included from /usr/include/c++/14/bits/stl_algo.h:61, 2025-09-04T16:36:13,092 from /usr/include/c++/14/algorithm:61, 2025-09-04T16:36:13,092 from networkit/cpp/centrality/../graph/Graph.h:11, 2025-09-04T16:36:13,092 from networkit/cpp/centrality/Centrality.h:11, 2025-09-04T16:36:13,093 from networkit/cpp/centrality/Centrality.cpp:8: 2025-09-04T16:36:13,093 /usr/include/c++/14/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator*, vector > >; _Distance = int; _Tp = pair; _Compare = __gnu_cxx::__ops::_Iter_comp_iter, pair)> >]’: 2025-09-04T16:36:13,093 /usr/include/c++/14/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator*, std::vector > >’ changed in GCC 7.1 2025-09-04T16:36:13,094 224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex, 2025-09-04T16:36:13,094 | ^~~~~~~~~~~~~ 2025-09-04T16:36:13,225 /usr/include/c++/14/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator*, vector > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter, pair)> >]’: 2025-09-04T16:36:13,225 /usr/include/c++/14/bits/stl_algo.h:1876:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator*, std::vector > >’ changed in GCC 7.1 2025-09-04T16:36:13,225 1876 | __introsort_loop(_RandomAccessIterator __first, 2025-09-04T16:36:13,226 | ^~~~~~~~~~~~~~~~ 2025-09-04T16:36:13,226 /usr/include/c++/14/bits/stl_algo.h:1876:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator*, std::vector > >’ changed in GCC 7.1 2025-09-04T16:36:13,226 /usr/include/c++/14/bits/stl_algo.h:1890:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator*, std::vector > >’ changed in GCC 7.1 2025-09-04T16:36:13,227 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); 2025-09-04T16:36:13,227 | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:36:13,309 /usr/include/c++/14/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator*, vector > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter, pair)> >]’: 2025-09-04T16:36:13,310 /usr/include/c++/14/bits/stl_algo.h:1770:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator*, std::vector > >’ changed in GCC 7.1 2025-09-04T16:36:13,310 1770 | __insertion_sort(_RandomAccessIterator __first, 2025-09-04T16:36:13,310 | ^~~~~~~~~~~~~~~~ 2025-09-04T16:36:13,311 /usr/include/c++/14/bits/stl_algo.h:1770:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator*, std::vector > >’ changed in GCC 7.1 2025-09-04T16:36:13,416 In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator*, vector > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter, pair)> >]’, 2025-09-04T16:36:13,416 inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator*, vector > >; _Compare = NetworKit::Centrality::ranking()::, pair)>]’ at /usr/include/c++/14/bits/stl_algo.h:4805:18, 2025-09-04T16:36:13,417 inlined from ‘virtual std::vector > NetworKit::Centrality::ranking()’ at networkit/cpp/centrality/Centrality.cpp:25:11: 2025-09-04T16:36:13,417 /usr/include/c++/14/bits/stl_algo.h:1905:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator*, std::vector > >’ changed in GCC 7.1 2025-09-04T16:36:13,417 1905 | std::__introsort_loop(__first, __last, 2025-09-04T16:36:13,418 | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 2025-09-04T16:36:13,418 1906 | std::__lg(__last - __first) * 2, 2025-09-04T16:36:13,418 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:36:13,419 1907 | __comp); 2025-09-04T16:36:13,419 | ~~~~~~~ 2025-09-04T16:36:13,419 In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator*, vector > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter, pair)> >]’, 2025-09-04T16:36:13,420 inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator*, vector > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter, pair)> >]’ at /usr/include/c++/14/bits/stl_algo.h:1908:31, 2025-09-04T16:36:13,420 inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator*, vector > >; _Compare = NetworKit::Centrality::ranking()::, pair)>]’ at /usr/include/c++/14/bits/stl_algo.h:4805:18, 2025-09-04T16:36:13,420 inlined from ‘virtual std::vector > NetworKit::Centrality::ranking()’ at networkit/cpp/centrality/Centrality.cpp:25:11: 2025-09-04T16:36:13,421 /usr/include/c++/14/bits/stl_algo.h:1817:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator*, std::vector > >’ changed in GCC 7.1 2025-09-04T16:36:13,421 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); 2025-09-04T16:36:13,422 | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:36:13,422 /usr/include/c++/14/bits/stl_algo.h:1822:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator*, std::vector > >’ changed in GCC 7.1 2025-09-04T16:36:13,422 1822 | std::__insertion_sort(__first, __last, __comp); 2025-09-04T16:36:13,423 | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:36:13,526 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/Betweenness.o networkit/cpp/centrality/Betweenness.cpp 2025-09-04T16:36:13,753 In file included from networkit/cpp/centrality/../graph/../ext/ttmath/ttmathint.h:48, 2025-09-04T16:36:13,753 from networkit/cpp/centrality/../graph/../ext/ttmath/ttmathbig.h:46, 2025-09-04T16:36:13,754 from networkit/cpp/centrality/../graph/../ext/ttmath/ttmath.h:58, 2025-09-04T16:36:13,754 from networkit/cpp/centrality/../graph/../Globals.h:15, 2025-09-04T16:36:13,754 from networkit/cpp/centrality/../graph/Graph.h:19, 2025-09-04T16:36:13,754 from networkit/cpp/centrality/Centrality.h:11, 2025-09-04T16:36:13,755 from networkit/cpp/centrality/ApproxBetweenness.h:11, 2025-09-04T16:36:13,755 from networkit/cpp/centrality/ApproxBetweenness.cpp:8: 2025-09-04T16:36:13,755 In member function ‘void ttmath::UInt::Div3_Division(ttmath::UInt, ttmath::UInt*, ttmath::uint, ttmath::uint) [with unsigned int value_size = 2]’, 2025-09-04T16:36:13,755 inlined from ‘ttmath::uint ttmath::UInt::Div3Ref(const ttmath::UInt&, ttmath::UInt*) [with unsigned int value_size = 2]’ at networkit/cpp/centrality/../graph/../ext/ttmath/ttmathuint.h:2148:16: 2025-09-04T16:36:13,755 networkit/cpp/centrality/../graph/../ext/ttmath/ttmathuint.h:2193:32: warning: array subscript 4294967294 is above array bounds of ‘ttmath::uint [2]’ {aka ‘unsigned int [2]’} [-Warray-bounds=] 2025-09-04T16:36:13,756 2193 | q.table[j] = qp; 2025-09-04T16:36:13,756 | ~~~~~~~^ 2025-09-04T16:36:13,756 networkit/cpp/centrality/../graph/../ext/ttmath/ttmathuint.h: In function ‘ttmath::uint ttmath::UInt::Div3Ref(const ttmath::UInt&, ttmath::UInt*) [with unsigned int value_size = 2]’: 2025-09-04T16:36:13,756 networkit/cpp/centrality/../graph/../ext/ttmath/ttmathuint.h:81:14: note: while referencing ‘ttmath::UInt<2>::table’ 2025-09-04T16:36:13,756 81 | uint table[value_size]; 2025-09-04T16:36:13,756 | ^~~~~ 2025-09-04T16:36:16,281 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/LineFileReader.o networkit/cpp/io/LineFileReader.cpp 2025-09-04T16:36:16,347 In file included from /usr/include/c++/14/vector:72, 2025-09-04T16:36:16,348 from networkit/cpp/centrality/../graph/Graph.h:12, 2025-09-04T16:36:16,348 from networkit/cpp/centrality/Centrality.h:11, 2025-09-04T16:36:16,348 from networkit/cpp/centrality/PageRank.h:11, 2025-09-04T16:36:16,349 from networkit/cpp/centrality/PageRank.cpp:8: 2025-09-04T16:36:16,349 /usr/include/c++/14/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::_M_fill_insert(iterator, size_type, const value_type&) [with _Tp = double; _Alloc = std::allocator]’: 2025-09-04T16:36:16,349 /usr/include/c++/14/bits/vector.tcc:700:5: note: parameter passing for argument of type ‘std::vector::iterator’ changed in GCC 7.1 2025-09-04T16:36:16,350 700 | vector<_Tp, _Alloc>:: 2025-09-04T16:36:16,350 | ^~~~~~~~~~~~~~~~~~~ 2025-09-04T16:36:16,500 In file included from /usr/include/c++/14/vector:66: 2025-09-04T16:36:16,501 In member function ‘void std::vector<_Tp, _Alloc>::resize(size_type, const value_type&) [with _Tp = double; _Alloc = std::allocator]’, 2025-09-04T16:36:16,501 inlined from ‘virtual void NetworKit::PageRank::run()’ at networkit/cpp/centrality/PageRank.cpp:24:18: 2025-09-04T16:36:16,501 /usr/include/c++/14/bits/stl_vector.h:1037:25: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator >’ changed in GCC 7.1 2025-09-04T16:36:16,501 1037 | _M_fill_insert(end(), __new_size - size(), __x); 2025-09-04T16:36:16,502 | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:36:16,606 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/PartitionWriter.o networkit/cpp/io/PartitionWriter.cpp 2025-09-04T16:36:17,188 In file included from networkit/cpp/centrality/../graph/../ext/ttmath/ttmathint.h:48, 2025-09-04T16:36:17,188 from networkit/cpp/centrality/../graph/../ext/ttmath/ttmathbig.h:46, 2025-09-04T16:36:17,188 from networkit/cpp/centrality/../graph/../ext/ttmath/ttmath.h:58, 2025-09-04T16:36:17,189 from networkit/cpp/centrality/../graph/../Globals.h:15, 2025-09-04T16:36:17,189 from networkit/cpp/centrality/../graph/Graph.h:19, 2025-09-04T16:36:17,189 from networkit/cpp/centrality/Centrality.h:11, 2025-09-04T16:36:17,190 from networkit/cpp/centrality/DynBetweenness.h:11, 2025-09-04T16:36:17,190 from networkit/cpp/centrality/DynBetweenness.cpp:12: 2025-09-04T16:36:17,190 In member function ‘void ttmath::UInt::Div3_Division(ttmath::UInt, ttmath::UInt*, ttmath::uint, ttmath::uint) [with unsigned int value_size = 2]’, 2025-09-04T16:36:17,191 inlined from ‘ttmath::uint ttmath::UInt::Div3Ref(const ttmath::UInt&, ttmath::UInt*) [with unsigned int value_size = 2]’ at networkit/cpp/centrality/../graph/../ext/ttmath/ttmathuint.h:2148:16: 2025-09-04T16:36:17,191 networkit/cpp/centrality/../graph/../ext/ttmath/ttmathuint.h:2193:32: warning: array subscript 4294967294 is above array bounds of ‘ttmath::uint [2]’ {aka ‘unsigned int [2]’} [-Warray-bounds=] 2025-09-04T16:36:17,191 2193 | q.table[j] = qp; 2025-09-04T16:36:17,191 | ~~~~~~~^ 2025-09-04T16:36:17,192 networkit/cpp/centrality/../graph/../ext/ttmath/ttmathuint.h: In function ‘ttmath::uint ttmath::UInt::Div3Ref(const ttmath::UInt&, ttmath::UInt*) [with unsigned int value_size = 2]’: 2025-09-04T16:36:17,192 networkit/cpp/centrality/../graph/../ext/ttmath/ttmathuint.h:81:14: note: while referencing ‘ttmath::UInt<2>::table’ 2025-09-04T16:36:17,193 81 | uint table[value_size]; 2025-09-04T16:36:17,193 | ^~~~~ 2025-09-04T16:36:18,513 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/DGSReader.o networkit/cpp/io/DGSReader.cpp 2025-09-04T16:36:20,125 In file included from networkit/cpp/centrality/../graph/../ext/ttmath/ttmathint.h:48, 2025-09-04T16:36:20,126 from networkit/cpp/centrality/../graph/../ext/ttmath/ttmathbig.h:46, 2025-09-04T16:36:20,126 from networkit/cpp/centrality/../graph/../ext/ttmath/ttmath.h:58, 2025-09-04T16:36:20,126 from networkit/cpp/centrality/../graph/../Globals.h:15, 2025-09-04T16:36:20,126 from networkit/cpp/centrality/../graph/Graph.h:19, 2025-09-04T16:36:20,126 from networkit/cpp/centrality/Centrality.h:11, 2025-09-04T16:36:20,127 from networkit/cpp/centrality/Betweenness.h:11, 2025-09-04T16:36:20,127 from networkit/cpp/centrality/Betweenness.cpp:14: 2025-09-04T16:36:20,127 In member function ‘void ttmath::UInt::Div3_Division(ttmath::UInt, ttmath::UInt*, ttmath::uint, ttmath::uint) [with unsigned int value_size = 2]’, 2025-09-04T16:36:20,128 inlined from ‘ttmath::uint ttmath::UInt::Div3Ref(const ttmath::UInt&, ttmath::UInt*) [with unsigned int value_size = 2]’ at networkit/cpp/centrality/../graph/../ext/ttmath/ttmathuint.h:2148:16: 2025-09-04T16:36:20,128 networkit/cpp/centrality/../graph/../ext/ttmath/ttmathuint.h:2193:32: warning: array subscript 4294967294 is above array bounds of ‘ttmath::uint [2]’ {aka ‘unsigned int [2]’} [-Warray-bounds=] 2025-09-04T16:36:20,128 2193 | q.table[j] = qp; 2025-09-04T16:36:20,128 | ~~~~~~~^ 2025-09-04T16:36:20,128 networkit/cpp/centrality/../graph/../ext/ttmath/ttmathuint.h: In function ‘ttmath::uint ttmath::UInt::Div3Ref(const ttmath::UInt&, ttmath::UInt*) [with unsigned int value_size = 2]’: 2025-09-04T16:36:20,129 networkit/cpp/centrality/../graph/../ext/ttmath/ttmathuint.h:81:14: note: while referencing ‘ttmath::UInt<2>::table’ 2025-09-04T16:36:20,129 81 | uint table[value_size]; 2025-09-04T16:36:20,129 | ^~~~~ 2025-09-04T16:36:21,234 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/KONECTGraphReader.o networkit/cpp/io/KONECTGraphReader.cpp 2025-09-04T16:36:22,000 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/GraphToolBinaryWriter.o networkit/cpp/io/GraphToolBinaryWriter.cpp 2025-09-04T16:36:26,271 networkit/cpp/io/GraphToolBinaryWriter.cpp: In member function ‘void NetworKit::GraphToolBinaryWriter::writeComment(std::ofstream&)’: 2025-09-04T16:36:26,271 networkit/cpp/io/GraphToolBinaryWriter.cpp:57:9: warning: this ‘if’ clause does not guard... [-Wmisleading-indentation] 2025-09-04T16:36:26,271 57 | if (size > 0); 2025-09-04T16:36:26,272 | ^~ 2025-09-04T16:36:26,272 networkit/cpp/io/GraphToolBinaryWriter.cpp:58:17: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the ‘if’ 2025-09-04T16:36:26,272 58 | file.write(s.c_str(),size); 2025-09-04T16:36:26,273 | ^~~~ 2025-09-04T16:36:26,481 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/PartitionReader.o networkit/cpp/io/PartitionReader.cpp 2025-09-04T16:36:27,657 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/DynamicGraphReader.o networkit/cpp/io/DynamicGraphReader.cpp 2025-09-04T16:36:29,541 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/EdgeListWriter.o networkit/cpp/io/EdgeListWriter.cpp 2025-09-04T16:36:29,718 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/EdgeListReader.o networkit/cpp/io/EdgeListReader.cpp 2025-09-04T16:36:31,470 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/VNAGraphWriter.o networkit/cpp/io/VNAGraphWriter.cpp 2025-09-04T16:36:31,965 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/EdgeListCoverReader.o networkit/cpp/io/EdgeListCoverReader.cpp 2025-09-04T16:36:34,879 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/SNAPEdgeListPartitionReader.o networkit/cpp/io/SNAPEdgeListPartitionReader.cpp 2025-09-04T16:36:37,412 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/GraphIO.o networkit/cpp/io/GraphIO.cpp 2025-09-04T16:36:37,645 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/DotPartitionWriter.o networkit/cpp/io/DotPartitionWriter.cpp 2025-09-04T16:36:37,935 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/GraphToolBinaryReader.o networkit/cpp/io/GraphToolBinaryReader.cpp 2025-09-04T16:36:41,716 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/DotGraphWriter.o networkit/cpp/io/DotGraphWriter.cpp 2025-09-04T16:36:43,086 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/CoverWriter.o networkit/cpp/io/CoverWriter.cpp 2025-09-04T16:36:43,588 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/CoverReader.o networkit/cpp/io/CoverReader.cpp 2025-09-04T16:36:44,024 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/SNAPGraphReader.o networkit/cpp/io/SNAPGraphReader.cpp 2025-09-04T16:36:46,689 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/DibapGraphReader.o networkit/cpp/io/DibapGraphReader.cpp 2025-09-04T16:36:48,160 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/EdgeListPartitionReader.o networkit/cpp/io/EdgeListPartitionReader.cpp 2025-09-04T16:36:48,873 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/METISGraphWriter.o networkit/cpp/io/METISGraphWriter.cpp 2025-09-04T16:36:51,725 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/GDFGraphWriter.o networkit/cpp/io/GDFGraphWriter.cpp 2025-09-04T16:36:52,875 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/GMLGraphReader.o networkit/cpp/io/GMLGraphReader.cpp 2025-09-04T16:36:53,513 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/METISGraphReader.o networkit/cpp/io/METISGraphReader.cpp 2025-09-04T16:36:55,450 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/GMLGraphWriter.o networkit/cpp/io/GMLGraphWriter.cpp 2025-09-04T16:36:57,224 networkit/cpp/io/GMLGraphReader.cpp: In lambda function: 2025-09-04T16:36:57,224 networkit/cpp/io/GMLGraphReader.cpp:69:57: warning: catching polymorphic type ‘class std::exception’ by value [-Wcatch-value=] 2025-09-04T16:36:57,224 69 | } catch (std::exception e) { 2025-09-04T16:36:57,224 | ^ 2025-09-04T16:36:57,231 networkit/cpp/io/GMLGraphReader.cpp: In lambda function: 2025-09-04T16:36:57,231 networkit/cpp/io/GMLGraphReader.cpp:101:57: warning: catching polymorphic type ‘class std::exception’ by value [-Wcatch-value=] 2025-09-04T16:36:57,232 101 | } catch (std::exception e) { 2025-09-04T16:36:57,232 | ^ 2025-09-04T16:36:57,238 networkit/cpp/io/GMLGraphReader.cpp: In lambda function: 2025-09-04T16:36:57,238 networkit/cpp/io/GMLGraphReader.cpp:141:81: warning: catching polymorphic type ‘class std::exception’ by value [-Wcatch-value=] 2025-09-04T16:36:57,238 141 | } catch (std::exception e) { 2025-09-04T16:36:57,238 | ^ 2025-09-04T16:36:57,637 networkit/cpp/io/METISGraphReader.cpp: In member function ‘virtual NetworKit::Graph NetworKit::METISGraphReader::read(const std::string&)’: 2025-09-04T16:36:57,638 networkit/cpp/io/METISGraphReader.cpp:46:16: warning: variable ‘p’ set but not used [-Wunused-but-set-variable] 2025-09-04T16:36:57,638 46 | double p = 0.0; // percentage for progress bar 2025-09-04T16:36:57,638 | ^ 2025-09-04T16:36:58,128 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/SNAPGraphWriter.o networkit/cpp/io/SNAPGraphWriter.cpp 2025-09-04T16:37:00,389 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/METISParser.o networkit/cpp/io/METISParser.cpp 2025-09-04T16:37:00,692 In lambda function, 2025-09-04T16:37:00,693 inlined from ‘NetworKit::GMLGraphReader::read(const std::string&)::’ at networkit/cpp/io/GMLGraphReader.cpp:158:28, 2025-09-04T16:37:00,693 inlined from ‘virtual NetworKit::Graph NetworKit::GMLGraphReader::read(const std::string&)’ at networkit/cpp/io/GMLGraphReader.cpp:180:23: 2025-09-04T16:37:00,694 networkit/cpp/io/GMLGraphReader.cpp:107:34: warning: ‘u’ may be used uninitialized [-Wmaybe-uninitialized] 2025-09-04T16:37:00,694 107 | G.addEdge(u,v); 2025-09-04T16:37:00,694 | ~~~~~~~~~^~~~~ 2025-09-04T16:37:00,695 networkit/cpp/io/GMLGraphReader.cpp: In member function ‘virtual NetworKit::Graph NetworKit::GMLGraphReader::read(const std::string&)’: 2025-09-04T16:37:00,695 networkit/cpp/io/GMLGraphReader.cpp:91:30: note: ‘u’ was declared here 2025-09-04T16:37:00,696 91 | node u,v; 2025-09-04T16:37:00,696 | ^ 2025-09-04T16:37:00,696 In lambda function, 2025-09-04T16:37:00,697 inlined from ‘NetworKit::GMLGraphReader::read(const std::string&)::’ at networkit/cpp/io/GMLGraphReader.cpp:158:28, 2025-09-04T16:37:00,697 inlined from ‘virtual NetworKit::Graph NetworKit::GMLGraphReader::read(const std::string&)’ at networkit/cpp/io/GMLGraphReader.cpp:180:23: 2025-09-04T16:37:00,698 networkit/cpp/io/GMLGraphReader.cpp:107:34: warning: ‘v’ may be used uninitialized [-Wmaybe-uninitialized] 2025-09-04T16:37:00,698 107 | G.addEdge(u,v); 2025-09-04T16:37:00,698 | ~~~~~~~~~^~~~~ 2025-09-04T16:37:00,698 networkit/cpp/io/GMLGraphReader.cpp: In member function ‘virtual NetworKit::Graph NetworKit::GMLGraphReader::read(const std::string&)’: 2025-09-04T16:37:00,699 networkit/cpp/io/GMLGraphReader.cpp:91:32: note: ‘v’ was declared here 2025-09-04T16:37:00,699 91 | node u,v; 2025-09-04T16:37:00,699 | ^ 2025-09-04T16:37:00,795 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/SelectiveCommunityDetector.o networkit/cpp/scd/SelectiveCommunityDetector.cpp 2025-09-04T16:37:01,289 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/ApproximatePageRank.o networkit/cpp/scd/ApproximatePageRank.cpp 2025-09-04T16:37:02,038 In file included from networkit/cpp/io/METISParser.cpp:8: 2025-09-04T16:37:02,038 networkit/cpp/io/METISParser.h:18:9: error: ‘uint64_t’ does not name a type 2025-09-04T16:37:02,039 18 | typedef uint64_t index; 2025-09-04T16:37:02,039 | ^~~~~~~~ 2025-09-04T16:37:02,040 networkit/cpp/io/METISParser.h:15:1: note: ‘uint64_t’ is defined in header ‘’; this is probably fixable by adding ‘#include ’ 2025-09-04T16:37:02,040 14 | #include 2025-09-04T16:37:02,040 +++ |+#include 2025-09-04T16:37:02,040 15 | 2025-09-04T16:37:02,044 networkit/cpp/io/METISParser.h:19:9: error: ‘index’ does not name a type 2025-09-04T16:37:02,044 19 | typedef index node; 2025-09-04T16:37:02,044 | ^~~~~ 2025-09-04T16:37:02,045 networkit/cpp/io/METISParser.h:20:9: error: ‘uint64_t’ does not name a type 2025-09-04T16:37:02,045 20 | typedef uint64_t count; 2025-09-04T16:37:02,045 | ^~~~~~~~ 2025-09-04T16:37:02,046 networkit/cpp/io/METISParser.h:20:9: note: ‘uint64_t’ is defined in header ‘’; this is probably fixable by adding ‘#include ’ 2025-09-04T16:37:02,061 networkit/cpp/io/METISParser.h:45:20: error: ‘count’ was not declared in this scope 2025-09-04T16:37:02,061 45 | std::tuple getHeader(); 2025-09-04T16:37:02,061 | ^~~~~ 2025-09-04T16:37:02,075 networkit/cpp/io/METISParser.h:45:27: error: ‘count’ was not declared in this scope 2025-09-04T16:37:02,076 45 | std::tuple getHeader(); 2025-09-04T16:37:02,076 | ^~~~~ 2025-09-04T16:37:02,090 networkit/cpp/io/METISParser.h:45:34: error: ‘index’ was not declared in this scope 2025-09-04T16:37:02,090 45 | std::tuple getHeader(); 2025-09-04T16:37:02,090 | ^~~~~ 2025-09-04T16:37:02,104 networkit/cpp/io/METISParser.h:45:41: error: ‘count’ was not declared in this scope 2025-09-04T16:37:02,105 45 | std::tuple getHeader(); 2025-09-04T16:37:02,105 | ^~~~~ 2025-09-04T16:37:02,105 networkit/cpp/io/METISParser.h:45:46: error: template argument 1 is invalid 2025-09-04T16:37:02,106 45 | std::tuple getHeader(); 2025-09-04T16:37:02,106 | ^ 2025-09-04T16:37:02,106 networkit/cpp/io/METISParser.h:45:46: error: template argument 2 is invalid 2025-09-04T16:37:02,107 networkit/cpp/io/METISParser.h:45:46: error: template argument 3 is invalid 2025-09-04T16:37:02,107 networkit/cpp/io/METISParser.h:45:46: error: template argument 4 is invalid 2025-09-04T16:37:02,120 networkit/cpp/io/METISParser.h:57:21: error: ‘node’ was not declared in this scope 2025-09-04T16:37:02,120 57 | std::vector getNext(count ignoreFirst = 0); 2025-09-04T16:37:02,121 | ^~~~ 2025-09-04T16:37:02,121 networkit/cpp/io/METISParser.h:57:25: error: template argument 1 is invalid 2025-09-04T16:37:02,121 57 | std::vector getNext(count ignoreFirst = 0); 2025-09-04T16:37:02,122 | ^ 2025-09-04T16:37:02,122 networkit/cpp/io/METISParser.h:57:25: error: template argument 2 is invalid 2025-09-04T16:37:02,122 networkit/cpp/io/METISParser.h:57:35: error: ‘count’ has not been declared 2025-09-04T16:37:02,123 57 | std::vector getNext(count ignoreFirst = 0); 2025-09-04T16:37:02,123 | ^~~~~ 2025-09-04T16:37:02,136 networkit/cpp/io/METISParser.h:64:31: error: ‘node’ was not declared in this scope 2025-09-04T16:37:02,136 64 | std::vector> getNextWithWeights(count ignoreFirst = 0); 2025-09-04T16:37:02,137 | ^~~~ 2025-09-04T16:37:02,137 networkit/cpp/io/METISParser.h:64:36: error: template argument 1 is invalid 2025-09-04T16:37:02,137 64 | std::vector> getNextWithWeights(count ignoreFirst = 0); 2025-09-04T16:37:02,137 | ^~~~~~ 2025-09-04T16:37:02,138 networkit/cpp/io/METISParser.h:64:42: error: template argument 1 is invalid 2025-09-04T16:37:02,138 64 | std::vector> getNextWithWeights(count ignoreFirst = 0); 2025-09-04T16:37:02,138 | ^~ 2025-09-04T16:37:02,138 networkit/cpp/io/METISParser.h:64:42: error: template argument 2 is invalid 2025-09-04T16:37:02,139 networkit/cpp/io/METISParser.h:64:64: error: ‘count’ has not been declared 2025-09-04T16:37:02,139 64 | std::vector> getNextWithWeights(count ignoreFirst = 0); 2025-09-04T16:37:02,139 | ^~~~~ 2025-09-04T16:37:02,271 In file included from networkit/cpp/io/METISParser.cpp:10: 2025-09-04T16:37:02,271 networkit/cpp/io/../auxiliary/NumberParsing.h: In function ‘std::tuple<_T1, _T2> Aux::Parsing::Impl::strTo(CharIterator, CharIterator, RealTag)’: 2025-09-04T16:37:02,272 networkit/cpp/io/../auxiliary/NumberParsing.h:140:53: error: ‘uintmax_t’ is not a member of ‘std’ 2025-09-04T16:37:02,272 140 | <= std::numeric_limits::digits10, 2025-09-04T16:37:02,272 | ^~~~~~~~~ 2025-09-04T16:37:02,273 networkit/cpp/io/../auxiliary/NumberParsing.h:14:1: note: ‘std::uintmax_t’ is defined in header ‘’; this is probably fixable by adding ‘#include ’ 2025-09-04T16:37:02,274 13 | #include "Enforce.h" 2025-09-04T16:37:02,274 +++ |+#include 2025-09-04T16:37:02,274 14 | 2025-09-04T16:37:02,275 networkit/cpp/io/../auxiliary/NumberParsing.h:140:53: error: ‘uintmax_t’ is not a member of ‘std’ 2025-09-04T16:37:02,275 140 | <= std::numeric_limits::digits10, 2025-09-04T16:37:02,276 | ^~~~~~~~~ 2025-09-04T16:37:02,276 networkit/cpp/io/../auxiliary/NumberParsing.h:140:53: note: ‘std::uintmax_t’ is defined in header ‘’; this is probably fixable by adding ‘#include ’ 2025-09-04T16:37:02,277 networkit/cpp/io/../auxiliary/NumberParsing.h:140:62: error: template argument 1 is invalid 2025-09-04T16:37:02,277 140 | <= std::numeric_limits::digits10, 2025-09-04T16:37:02,278 | ^ 2025-09-04T16:37:02,279 networkit/cpp/io/../auxiliary/NumberParsing.h:148:14: error: ‘uintmax_t’ is not a member of ‘std’ 2025-09-04T16:37:02,279 148 | std::uintmax_t mantissa = 0; 2025-09-04T16:37:02,279 | ^~~~~~~~~ 2025-09-04T16:37:02,282 networkit/cpp/io/../auxiliary/NumberParsing.h:148:14: note: ‘std::uintmax_t’ is defined in header ‘’; this is probably fixable by adding ‘#include ’ 2025-09-04T16:37:02,297 networkit/cpp/io/../auxiliary/NumberParsing.h: In lambda function: 2025-09-04T16:37:02,297 networkit/cpp/io/../auxiliary/NumberParsing.h:152:36: error: ‘mantissa’ was not declared in this scope; did you mean ‘fp_mantissa’? 2025-09-04T16:37:02,298 152 | Real fp_mantissa = mantissa; 2025-09-04T16:37:02,298 | ^~~~~~~~ 2025-09-04T16:37:02,298 | fp_mantissa 2025-09-04T16:37:02,309 networkit/cpp/io/../auxiliary/NumberParsing.h: In function ‘std::tuple<_T1, _T2> Aux::Parsing::Impl::strTo(CharIterator, CharIterator, RealTag)’: 2025-09-04T16:37:02,309 networkit/cpp/io/../auxiliary/NumberParsing.h:190:17: error: ‘mantissa’ was not declared in this scope 2025-09-04T16:37:02,309 190 | mantissa *= 10; 2025-09-04T16:37:02,310 | ^~~~~~~~ 2025-09-04T16:37:02,320 networkit/cpp/io/../auxiliary/NumberParsing.h:202:35: error: ‘mantissa’ was not declared in this scope 2025-09-04T16:37:02,320 202 | ++mantissa; 2025-09-04T16:37:02,321 | ^~~~~~~~ 2025-09-04T16:37:02,331 networkit/cpp/io/../auxiliary/NumberParsing.h:227:25: error: ‘mantissa’ was not declared in this scope 2025-09-04T16:37:02,332 227 | mantissa *= 10; 2025-09-04T16:37:02,332 | ^~~~~~~~ 2025-09-04T16:37:02,342 networkit/cpp/io/../auxiliary/NumberParsing.h:238:35: error: ‘mantissa’ was not declared in this scope 2025-09-04T16:37:02,342 238 | ++mantissa; 2025-09-04T16:37:02,342 | ^~~~~~~~ 2025-09-04T16:37:02,586 networkit/cpp/io/METISParser.cpp: At global scope: 2025-09-04T16:37:02,586 networkit/cpp/io/METISParser.cpp:28:20: error: ‘node’ was not declared in this scope 2025-09-04T16:37:02,587 28 | static std::vector parseLine(const std::string& line, count ignoreFirst = 0) { 2025-09-04T16:37:02,587 | ^~~~ 2025-09-04T16:37:02,587 networkit/cpp/io/METISParser.cpp:28:24: error: template argument 1 is invalid 2025-09-04T16:37:02,588 28 | static std::vector parseLine(const std::string& line, count ignoreFirst = 0) { 2025-09-04T16:37:02,588 | ^ 2025-09-04T16:37:02,588 networkit/cpp/io/METISParser.cpp:28:24: error: template argument 2 is invalid 2025-09-04T16:37:02,589 networkit/cpp/io/METISParser.cpp:28:61: error: ‘count’ has not been declared 2025-09-04T16:37:02,590 28 | static std::vector parseLine(const std::string& line, count ignoreFirst = 0) { 2025-09-04T16:37:02,590 | ^~~~~ 2025-09-04T16:37:02,600 networkit/cpp/io/METISParser.cpp: In function ‘int NetworKit::parseLine(const std::string&, int)’: 2025-09-04T16:37:02,600 networkit/cpp/io/METISParser.cpp:31:21: error: ‘node’ was not declared in this scope 2025-09-04T16:37:02,600 31 | std::vector adjacencies; 2025-09-04T16:37:02,601 | ^~~~ 2025-09-04T16:37:02,601 networkit/cpp/io/METISParser.cpp:31:25: error: template argument 1 is invalid 2025-09-04T16:37:02,602 31 | std::vector adjacencies; 2025-09-04T16:37:02,602 | ^ 2025-09-04T16:37:02,602 networkit/cpp/io/METISParser.cpp:31:25: error: template argument 2 is invalid 2025-09-04T16:37:02,603 networkit/cpp/io/METISParser.cpp:32:13: error: expected ‘;’ before ‘v’ 2025-09-04T16:37:02,603 32 | node v; 2025-09-04T16:37:02,603 | ^~ 2025-09-04T16:37:02,604 | ; 2025-09-04T16:37:02,613 networkit/cpp/io/METISParser.cpp:33:9: error: ‘index’ was not declared in this scope 2025-09-04T16:37:02,614 33 | index i = 0; 2025-09-04T16:37:02,614 | ^~~~~ 2025-09-04T16:37:02,622 networkit/cpp/io/METISParser.cpp:35:16: error: ‘i’ was not declared in this scope; did you mean ‘it’? 2025-09-04T16:37:02,623 35 | while (i < ignoreFirst) { 2025-09-04T16:37:02,623 | ^ 2025-09-04T16:37:02,624 | it 2025-09-04T16:37:02,665 networkit/cpp/io/METISParser.cpp:43:26: error: ‘v’ was not declared in this scope 2025-09-04T16:37:02,665 43 | std::tie(v, it) = Aux::Parsing::strTo(it,end); 2025-09-04T16:37:02,665 | ^ 2025-09-04T16:37:02,666 networkit/cpp/io/METISParser.cpp:43:60: error: no matching function for call to ‘strTo(__gnu_cxx::__normal_iterator >&, __gnu_cxx::__normal_iterator >&)’ 2025-09-04T16:37:02,666 43 | std::tie(v, it) = Aux::Parsing::strTo(it,end); 2025-09-04T16:37:02,667 | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~ 2025-09-04T16:37:02,667 networkit/cpp/io/../auxiliary/NumberParsing.h:67:34: note: candidate: ‘template std::tuple<_T1, _T2> Aux::Parsing::strTo(CharIterator, CharIterator)’ 2025-09-04T16:37:02,668 67 | std::tuple strTo(CharIterator it, CharIterator end) { 2025-09-04T16:37:02,668 | ^~~~~ 2025-09-04T16:37:02,669 networkit/cpp/io/../auxiliary/NumberParsing.h:67:34: note: template argument deduction/substitution failed: 2025-09-04T16:37:02,669 networkit/cpp/io/METISParser.cpp:44:29: error: request for member ‘push_back’ in ‘adjacencies’, which is of non-class type ‘int’ 2025-09-04T16:37:02,670 44 | adjacencies.push_back(v); 2025-09-04T16:37:02,670 | ^~~~~~~~~ 2025-09-04T16:37:02,680 networkit/cpp/io/METISParser.cpp: At global scope: 2025-09-04T16:37:02,680 networkit/cpp/io/METISParser.cpp:57:30: error: ‘node’ was not declared in this scope 2025-09-04T16:37:02,680 57 | static std::vector> parseWeightedLine(std::string line, count ignoreFirst = 0) { 2025-09-04T16:37:02,681 | ^~~~ 2025-09-04T16:37:02,681 networkit/cpp/io/METISParser.cpp:57:35: error: template argument 1 is invalid 2025-09-04T16:37:02,682 57 | static std::vector> parseWeightedLine(std::string line, count ignoreFirst = 0) { 2025-09-04T16:37:02,682 | ^~~~~~ 2025-09-04T16:37:02,683 networkit/cpp/io/METISParser.cpp:57:41: error: template argument 1 is invalid 2025-09-04T16:37:02,684 57 | static std::vector> parseWeightedLine(std::string line, count ignoreFirst = 0) { 2025-09-04T16:37:02,684 | ^~ 2025-09-04T16:37:02,685 networkit/cpp/io/METISParser.cpp:57:41: error: template argument 2 is invalid 2025-09-04T16:37:02,686 networkit/cpp/io/METISParser.cpp:57:80: error: ‘count’ has not been declared 2025-09-04T16:37:02,686 57 | static std::vector> parseWeightedLine(std::string line, count ignoreFirst = 0) { 2025-09-04T16:37:02,686 | ^~~~~ 2025-09-04T16:37:02,698 networkit/cpp/io/METISParser.cpp: In function ‘int NetworKit::parseWeightedLine(std::string, int)’: 2025-09-04T16:37:02,699 networkit/cpp/io/METISParser.cpp:60:31: error: ‘node’ was not declared in this scope 2025-09-04T16:37:02,699 60 | std::vector> adjacencies; 2025-09-04T16:37:02,699 | ^~~~ 2025-09-04T16:37:02,700 networkit/cpp/io/METISParser.cpp:60:36: error: template argument 1 is invalid 2025-09-04T16:37:02,700 60 | std::vector> adjacencies; 2025-09-04T16:37:02,701 | ^~~~~~ 2025-09-04T16:37:02,702 networkit/cpp/io/METISParser.cpp:60:42: error: template argument 1 is invalid 2025-09-04T16:37:02,702 60 | std::vector> adjacencies; 2025-09-04T16:37:02,702 | ^~ 2025-09-04T16:37:02,703 networkit/cpp/io/METISParser.cpp:60:42: error: template argument 2 is invalid 2025-09-04T16:37:02,704 networkit/cpp/io/METISParser.cpp:61:13: error: expected ‘;’ before ‘v’ 2025-09-04T16:37:02,704 61 | node v; 2025-09-04T16:37:02,704 | ^~ 2025-09-04T16:37:02,705 | ; 2025-09-04T16:37:02,714 networkit/cpp/io/METISParser.cpp:63:9: error: ‘index’ was not declared in this scope 2025-09-04T16:37:02,714 63 | index i = 0; 2025-09-04T16:37:02,714 | ^~~~~ 2025-09-04T16:37:02,723 networkit/cpp/io/METISParser.cpp:66:16: error: ‘i’ was not declared in this scope; did you mean ‘it’? 2025-09-04T16:37:02,723 66 | while (i < ignoreFirst) { 2025-09-04T16:37:02,723 | ^ 2025-09-04T16:37:02,723 | it 2025-09-04T16:37:02,763 networkit/cpp/io/METISParser.cpp:75:34: error: ‘v’ was not declared in this scope 2025-09-04T16:37:02,764 75 | std::tie(v, it) = Aux::Parsing::strTo(it,end); 2025-09-04T16:37:02,764 | ^ 2025-09-04T16:37:02,765 networkit/cpp/io/METISParser.cpp:75:68: error: no matching function for call to ‘strTo(__gnu_cxx::__normal_iterator >&, __gnu_cxx::__normal_iterator >&)’ 2025-09-04T16:37:02,765 75 | std::tie(v, it) = Aux::Parsing::strTo(it,end); 2025-09-04T16:37:02,766 | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~ 2025-09-04T16:37:02,766 networkit/cpp/io/../auxiliary/NumberParsing.h:67:34: note: candidate: ‘template std::tuple<_T1, _T2> Aux::Parsing::strTo(CharIterator, CharIterator)’ 2025-09-04T16:37:02,767 67 | std::tuple strTo(CharIterator it, CharIterator end) { 2025-09-04T16:37:02,767 | ^~~~~ 2025-09-04T16:37:02,768 networkit/cpp/io/../auxiliary/NumberParsing.h:67:34: note: template argument deduction/substitution failed: 2025-09-04T16:37:02,770 networkit/cpp/io/METISParser.cpp:77:37: error: request for member ‘push_back’ in ‘adjacencies’, which is of non-class type ‘int’ 2025-09-04T16:37:02,771 77 | adjacencies.push_back(std::make_pair(v,weight)); 2025-09-04T16:37:02,771 | ^~~~~~~~~ 2025-09-04T16:37:02,772 networkit/cpp/io/METISParser.cpp:79:41: warning: catching polymorphic type ‘class std::exception’ by value [-Wcatch-value=] 2025-09-04T16:37:02,773 79 | } catch (std::exception e) { 2025-09-04T16:37:02,773 | ^ 2025-09-04T16:37:02,777 networkit/cpp/io/METISParser.cpp: At global scope: 2025-09-04T16:37:02,777 networkit/cpp/io/METISParser.cpp:97:12: error: ‘count’ was not declared in this scope; did you mean ‘std::count’? 2025-09-04T16:37:02,777 97 | std::tuple METISParser::getHeader() { 2025-09-04T16:37:02,778 | ^~~~~ 2025-09-04T16:37:02,778 | std::count 2025-09-04T16:37:02,778 In file included from /usr/include/c++/14/algorithm:61, 2025-09-04T16:37:02,779 from networkit/cpp/io/../auxiliary/NumberParsing.h:4: 2025-09-04T16:37:02,779 /usr/include/c++/14/bits/stl_algo.h:4025:5: note: ‘std::count’ declared here 2025-09-04T16:37:02,779 4025 | count(_InputIterator __first, _InputIterator __last, const _Tp& __value) 2025-09-04T16:37:02,779 | ^~~~~ 2025-09-04T16:37:02,781 networkit/cpp/io/METISParser.cpp:97:19: error: ‘count’ was not declared in this scope; did you mean ‘std::count’? 2025-09-04T16:37:02,781 97 | std::tuple METISParser::getHeader() { 2025-09-04T16:37:02,781 | ^~~~~ 2025-09-04T16:37:02,782 | std::count 2025-09-04T16:37:02,782 /usr/include/c++/14/bits/stl_algo.h:4025:5: note: ‘std::count’ declared here 2025-09-04T16:37:02,782 4025 | count(_InputIterator __first, _InputIterator __last, const _Tp& __value) 2025-09-04T16:37:02,783 | ^~~~~ 2025-09-04T16:37:02,791 networkit/cpp/io/METISParser.cpp:97:26: error: ‘index’ was not declared in this scope 2025-09-04T16:37:02,792 97 | std::tuple METISParser::getHeader() { 2025-09-04T16:37:02,792 | ^~~~~ 2025-09-04T16:37:02,793 networkit/cpp/io/METISParser.cpp:97:33: error: ‘count’ was not declared in this scope; did you mean ‘std::count’? 2025-09-04T16:37:02,793 97 | std::tuple METISParser::getHeader() { 2025-09-04T16:37:02,793 | ^~~~~ 2025-09-04T16:37:02,794 | std::count 2025-09-04T16:37:02,794 /usr/include/c++/14/bits/stl_algo.h:4025:5: note: ‘std::count’ declared here 2025-09-04T16:37:02,794 4025 | count(_InputIterator __first, _InputIterator __last, const _Tp& __value) 2025-09-04T16:37:02,795 | ^~~~~ 2025-09-04T16:37:02,795 networkit/cpp/io/METISParser.cpp:97:38: error: template argument 1 is invalid 2025-09-04T16:37:02,796 97 | std::tuple METISParser::getHeader() { 2025-09-04T16:37:02,796 | ^ 2025-09-04T16:37:02,796 networkit/cpp/io/METISParser.cpp:97:38: error: template argument 2 is invalid 2025-09-04T16:37:02,797 networkit/cpp/io/METISParser.cpp:97:38: error: template argument 3 is invalid 2025-09-04T16:37:02,798 networkit/cpp/io/METISParser.cpp:97:38: error: template argument 4 is invalid 2025-09-04T16:37:02,799 networkit/cpp/io/METISParser.cpp: In member function ‘int NetworKit::METISParser::getHeader()’: 2025-09-04T16:37:02,800 networkit/cpp/io/METISParser.cpp:99:9: error: ‘count’ was not declared in this scope; did you mean ‘std::count’? 2025-09-04T16:37:02,800 99 | count n; // number of nodes 2025-09-04T16:37:02,800 | ^~~~~ 2025-09-04T16:37:02,801 | std::count 2025-09-04T16:37:02,801 /usr/include/c++/14/bits/stl_algo.h:4025:5: note: ‘std::count’ declared here 2025-09-04T16:37:02,802 4025 | count(_InputIterator __first, _InputIterator __last, const _Tp& __value) 2025-09-04T16:37:02,802 | ^~~~~ 2025-09-04T16:37:02,803 networkit/cpp/io/METISParser.cpp:100:14: error: expected ‘;’ before ‘m’ 2025-09-04T16:37:02,803 100 | count m; // number of edges 2025-09-04T16:37:02,804 | ^~ 2025-09-04T16:37:02,804 | ; 2025-09-04T16:37:02,821 networkit/cpp/io/METISParser.cpp:101:9: error: ‘index’ was not declared in this scope 2025-09-04T16:37:02,822 101 | index fmt = 0; // weighted or unweighted graph 2025-09-04T16:37:02,822 | ^~~~~ 2025-09-04T16:37:02,822 networkit/cpp/io/METISParser.cpp:102:14: error: expected ‘;’ before ‘ncon’ 2025-09-04T16:37:02,823 102 | count ncon = 0; // number of node weights 2025-09-04T16:37:02,823 | ^~~~~ 2025-09-04T16:37:02,824 | ; 2025-09-04T16:37:02,835 networkit/cpp/io/METISParser.cpp:113:57: error: conversion from ‘int’ to non-scalar type ‘std::vector’ requested 2025-09-04T16:37:02,836 113 | std::vector tokens = parseLine(line); 2025-09-04T16:37:02,836 | ~~~~~~~~~^~~~~~ 2025-09-04T16:37:02,849 networkit/cpp/io/METISParser.cpp:114:17: error: ‘n’ was not declared in this scope 2025-09-04T16:37:02,850 114 | n = tokens[0]; 2025-09-04T16:37:02,850 | ^ 2025-09-04T16:37:02,863 networkit/cpp/io/METISParser.cpp:115:17: error: ‘m’ was not declared in this scope; did you mean ‘tm’? 2025-09-04T16:37:02,864 115 | m = tokens[1]; 2025-09-04T16:37:02,864 | ^ 2025-09-04T16:37:02,864 | tm 2025-09-04T16:37:02,877 networkit/cpp/io/METISParser.cpp:117:75: error: ‘fmt’ was not declared in this scope 2025-09-04T16:37:02,878 117 | return std::tuple(n,m,fmt,ncon); 2025-09-04T16:37:02,878 | ^~~ 2025-09-04T16:37:02,892 networkit/cpp/io/METISParser.cpp:117:79: error: ‘ncon’ was not declared in this scope 2025-09-04T16:37:02,892 117 | return std::tuple(n,m,fmt,ncon); 2025-09-04T16:37:02,892 | ^~~~ 2025-09-04T16:37:02,906 networkit/cpp/io/METISParser.cpp:120:25: error: ‘fmt’ was not declared in this scope 2025-09-04T16:37:02,906 120 | fmt = tokens[2]; 2025-09-04T16:37:02,906 | ^~~ 2025-09-04T16:37:02,922 networkit/cpp/io/METISParser.cpp:125:33: error: ‘ncon’ was not declared in this scope 2025-09-04T16:37:02,922 125 | ncon = tokens[3]; 2025-09-04T16:37:02,923 | ^~~~ 2025-09-04T16:37:02,936 networkit/cpp/io/METISParser.cpp:127:33: error: ‘ncon’ was not declared in this scope 2025-09-04T16:37:02,937 127 | ncon = 1; 2025-09-04T16:37:02,937 | ^~~~ 2025-09-04T16:37:02,950 networkit/cpp/io/METISParser.cpp:130:67: error: ‘fmt’ was not declared in this scope 2025-09-04T16:37:02,950 130 | return std::tuple(n,m,fmt,ncon); 2025-09-04T16:37:02,950 | ^~~ 2025-09-04T16:37:02,964 networkit/cpp/io/METISParser.cpp:130:71: error: ‘ncon’ was not declared in this scope 2025-09-04T16:37:02,965 130 | return std::tuple(n,m,fmt,ncon); 2025-09-04T16:37:02,965 | ^~~~ 2025-09-04T16:37:02,977 networkit/cpp/io/METISParser.cpp: At global scope: 2025-09-04T16:37:02,977 networkit/cpp/io/METISParser.cpp:147:13: error: ‘node’ was not declared in this scope 2025-09-04T16:37:02,977 147 | std::vector METISParser::getNext(count ignoreFirst) { 2025-09-04T16:37:02,978 | ^~~~ 2025-09-04T16:37:02,978 networkit/cpp/io/METISParser.cpp:147:17: error: template argument 1 is invalid 2025-09-04T16:37:02,978 147 | std::vector METISParser::getNext(count ignoreFirst) { 2025-09-04T16:37:02,978 | ^ 2025-09-04T16:37:02,979 networkit/cpp/io/METISParser.cpp:147:17: error: template argument 2 is invalid 2025-09-04T16:37:02,979 networkit/cpp/io/METISParser.cpp:147:19: error: ‘int NetworKit::METISParser::getNext’ is not a static data member of ‘class NetworKit::METISParser’ 2025-09-04T16:37:02,980 147 | std::vector METISParser::getNext(count ignoreFirst) { 2025-09-04T16:37:02,980 | ^~~~~~~~~~~ 2025-09-04T16:37:02,981 networkit/cpp/io/METISParser.cpp:147:40: error: ‘count’ was not declared in this scope; did you mean ‘std::count’? 2025-09-04T16:37:02,981 147 | std::vector METISParser::getNext(count ignoreFirst) { 2025-09-04T16:37:02,981 | ^~~~~ 2025-09-04T16:37:02,982 | std::count 2025-09-04T16:37:02,982 /usr/include/c++/14/bits/stl_algo.h:4025:5: note: ‘std::count’ declared here 2025-09-04T16:37:02,983 4025 | count(_InputIterator __first, _InputIterator __last, const _Tp& __value) 2025-09-04T16:37:02,983 | ^~~~~ 2025-09-04T16:37:02,993 networkit/cpp/io/METISParser.cpp:168:23: error: ‘node’ was not declared in this scope 2025-09-04T16:37:02,993 168 | std::vector> METISParser::getNextWithWeights(count ignoreFirst) { 2025-09-04T16:37:02,993 | ^~~~ 2025-09-04T16:37:02,994 networkit/cpp/io/METISParser.cpp:168:28: error: template argument 1 is invalid 2025-09-04T16:37:02,994 168 | std::vector> METISParser::getNextWithWeights(count ignoreFirst) { 2025-09-04T16:37:02,995 | ^~~~~~ 2025-09-04T16:37:02,995 networkit/cpp/io/METISParser.cpp:168:34: error: template argument 1 is invalid 2025-09-04T16:37:02,995 168 | std::vector> METISParser::getNextWithWeights(count ignoreFirst) { 2025-09-04T16:37:02,996 | ^~ 2025-09-04T16:37:02,996 networkit/cpp/io/METISParser.cpp:168:34: error: template argument 2 is invalid 2025-09-04T16:37:02,997 networkit/cpp/io/METISParser.cpp:168:37: error: ‘int NetworKit::METISParser::getNextWithWeights’ is not a static data member of ‘class NetworKit::METISParser’ 2025-09-04T16:37:02,997 168 | std::vector> METISParser::getNextWithWeights(count ignoreFirst) { 2025-09-04T16:37:02,997 | ^~~~~~~~~~~ 2025-09-04T16:37:02,998 networkit/cpp/io/METISParser.cpp:168:69: error: ‘count’ was not declared in this scope; did you mean ‘std::count’? 2025-09-04T16:37:02,999 168 | std::vector> METISParser::getNextWithWeights(count ignoreFirst) { 2025-09-04T16:37:02,999 | ^~~~~ 2025-09-04T16:37:02,999 | std::count 2025-09-04T16:37:03,000 /usr/include/c++/14/bits/stl_algo.h:4025:5: note: ‘std::count’ declared here 2025-09-04T16:37:03,000 4025 | count(_InputIterator __first, _InputIterator __last, const _Tp& __value) 2025-09-04T16:37:03,000 | ^~~~~ 2025-09-04T16:37:03,612 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/PageRankNibble.o networkit/cpp/scd/PageRankNibble.cpp 2025-09-04T16:37:03,677 networkit/cpp/io/METISParser.cpp:57:44: warning: ‘int NetworKit::parseWeightedLine(std::string, int)’ defined but not used [-Wunused-function] 2025-09-04T16:37:03,678 57 | static std::vector> parseWeightedLine(std::string line, count ignoreFirst = 0) { 2025-09-04T16:37:03,678 | ^~~~~~~~~~~~~~~~~ 2025-09-04T16:37:03,695 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/GCE.o networkit/cpp/scd/GCE.cpp 2025-09-04T16:37:03,695 compilation of a file went wrong, exiting... 2025-09-04T16:37:05,282 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/Sampling.o networkit/cpp/graph/Sampling.cpp 2025-09-04T16:37:07,348 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/BFS.o networkit/cpp/graph/BFS.cpp 2025-09-04T16:37:07,894 networkit/cpp/scd/GCE.cpp: In member function ‘std::set NetworKit::GCE::expandSeed(NetworKit::node)’: 2025-09-04T16:37:07,895 networkit/cpp/scd/GCE.cpp:67:14: warning: variable ‘shell’ set but not used [-Wunused-but-set-variable] 2025-09-04T16:37:07,895 67 | auto shell = [&](const std::set& C) { 2025-09-04T16:37:07,895 | ^~~~~ 2025-09-04T16:37:07,895 networkit/cpp/scd/GCE.cpp:137:10: warning: variable ‘acceptability’ set but not used [-Wunused-but-set-variable] 2025-09-04T16:37:07,896 137 | auto acceptability = [&](node v, std::set& C){ 2025-09-04T16:37:07,896 | ^~~~~~~~~~~~~ 2025-09-04T16:37:08,087 networkit/cpp/scd/PageRankNibble.cpp: In member function ‘std::set NetworKit::PageRankNibble::bestSweepSet(std::vector >&)’: 2025-09-04T16:37:08,087 networkit/cpp/scd/PageRankNibble.cpp:26:15: warning: unused variable ‘suppSize’ [-Wunused-variable] 2025-09-04T16:37:08,087 26 | count suppSize = pr.size(); 2025-09-04T16:37:08,087 | ^~~~~~~~ 2025-09-04T16:37:09,702 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/GraphTools.o networkit/cpp/graph/GraphTools.cpp 2025-09-04T16:37:09,919 In file included from /usr/include/c++/14/algorithm:61, 2025-09-04T16:37:09,919 from networkit/cpp/scd/../graph/Graph.h:11, 2025-09-04T16:37:09,919 from networkit/cpp/scd/PageRankNibble.h:13, 2025-09-04T16:37:09,920 from networkit/cpp/scd/PageRankNibble.cpp:8: 2025-09-04T16:37:09,920 /usr/include/c++/14/bits/stl_algo.h: In function ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator*, vector > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter >&)::&, const pair&)> >]’: 2025-09-04T16:37:09,920 /usr/include/c++/14/bits/stl_algo.h:1750:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator*, std::vector > >’ changed in GCC 7.1 2025-09-04T16:37:09,920 1750 | __unguarded_linear_insert(_RandomAccessIterator __last, 2025-09-04T16:37:09,921 | ^~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:37:09,969 /usr/include/c++/14/bits/stl_algo.h: In function ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator*, vector > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter >&)::&, const pair&)> >]’: 2025-09-04T16:37:09,970 /usr/include/c++/14/bits/stl_algo.h:1770:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator*, std::vector > >’ changed in GCC 7.1 2025-09-04T16:37:09,970 1770 | __insertion_sort(_RandomAccessIterator __first, 2025-09-04T16:37:09,970 | ^~~~~~~~~~~~~~~~ 2025-09-04T16:37:09,971 /usr/include/c++/14/bits/stl_algo.h:1770:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator*, std::vector > >’ changed in GCC 7.1 2025-09-04T16:37:10,047 In file included from /usr/include/c++/14/bits/stl_algo.h:61: 2025-09-04T16:37:10,047 /usr/include/c++/14/bits/stl_heap.h: In function ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator*, vector > >; _Distance = int; _Tp = pair; _Compare = __gnu_cxx::__ops::_Iter_comp_iter >&)::&, const pair&)> >]’: 2025-09-04T16:37:10,048 /usr/include/c++/14/bits/stl_heap.h:224:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator*, std::vector > >’ changed in GCC 7.1 2025-09-04T16:37:10,048 224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex, 2025-09-04T16:37:10,048 | ^~~~~~~~~~~~~ 2025-09-04T16:37:10,429 /usr/include/c++/14/bits/stl_algo.h: In function ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator*, vector > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter >&)::&, const pair&)> >]’: 2025-09-04T16:37:10,429 /usr/include/c++/14/bits/stl_algo.h:1876:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator*, std::vector > >’ changed in GCC 7.1 2025-09-04T16:37:10,430 1876 | __introsort_loop(_RandomAccessIterator __first, 2025-09-04T16:37:10,430 | ^~~~~~~~~~~~~~~~ 2025-09-04T16:37:10,430 /usr/include/c++/14/bits/stl_algo.h:1876:5: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator*, std::vector > >’ changed in GCC 7.1 2025-09-04T16:37:10,433 /usr/include/c++/14/bits/stl_algo.h:1890:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator*, std::vector > >’ changed in GCC 7.1 2025-09-04T16:37:10,433 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); 2025-09-04T16:37:10,434 | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:37:10,987 In function ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator*, vector > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter >&)::&, const pair&)> >]’, 2025-09-04T16:37:10,987 inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator*, vector > >; _Compare = NetworKit::PageRankNibble::bestSweepSet(std::vector >&)::&, const pair&)>]’ at /usr/include/c++/14/bits/stl_algo.h:4805:18, 2025-09-04T16:37:10,988 inlined from ‘std::set NetworKit::PageRankNibble::bestSweepSet(std::vector >&)’ at networkit/cpp/scd/PageRankNibble.cpp:35:11: 2025-09-04T16:37:10,988 /usr/include/c++/14/bits/stl_algo.h:1905:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator*, std::vector > >’ changed in GCC 7.1 2025-09-04T16:37:10,988 1905 | std::__introsort_loop(__first, __last, 2025-09-04T16:37:10,988 | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 2025-09-04T16:37:10,989 1906 | std::__lg(__last - __first) * 2, 2025-09-04T16:37:10,989 | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:37:10,989 1907 | __comp); 2025-09-04T16:37:10,989 | ~~~~~~~ 2025-09-04T16:37:10,990 In function ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator*, vector > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter >&)::&, const pair&)> >]’, 2025-09-04T16:37:10,991 inlined from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator*, vector > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter >&)::&, const pair&)> >]’ at /usr/include/c++/14/bits/stl_algo.h:1908:31, 2025-09-04T16:37:10,991 inlined from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator*, vector > >; _Compare = NetworKit::PageRankNibble::bestSweepSet(std::vector >&)::&, const pair&)>]’ at /usr/include/c++/14/bits/stl_algo.h:4805:18, 2025-09-04T16:37:10,992 inlined from ‘std::set NetworKit::PageRankNibble::bestSweepSet(std::vector >&)’ at networkit/cpp/scd/PageRankNibble.cpp:35:11: 2025-09-04T16:37:10,992 /usr/include/c++/14/bits/stl_algo.h:1817:32: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator*, std::vector > >’ changed in GCC 7.1 2025-09-04T16:37:10,992 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); 2025-09-04T16:37:10,993 | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:37:10,993 /usr/include/c++/14/bits/stl_algo.h:1822:30: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator*, std::vector > >’ changed in GCC 7.1 2025-09-04T16:37:10,994 1822 | std::__insertion_sort(__first, __last, __comp); 2025-09-04T16:37:10,994 | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:37:11,866 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/DynDijkstra.o networkit/cpp/graph/DynDijkstra.cpp 2025-09-04T16:37:12,050 g++ -c -std=c++11 -Wall -fmessage-length=0 -fPIC -fopenmp -O3 -DNDEBUG -DLOG_LEVEL=LOG_LEVEL_INFO -o.buildOpt/DynBFS.o networkit/cpp/graph/DynBFS.cpp 2025-09-04T16:37:13,495 In file included from /usr/include/c++/14/vector:72, 2025-09-04T16:37:13,496 from /usr/include/c++/14/queue:63, 2025-09-04T16:37:13,496 from networkit/cpp/graph/BFS.cpp:8: 2025-09-04T16:37:13,496 /usr/include/c++/14/bits/vector.tcc: In member function ‘void std::vector<_Tp, _Alloc>::_M_fill_insert(iterator, size_type, const value_type&) [with _Tp = double; _Alloc = std::allocator]’: 2025-09-04T16:37:13,497 /usr/include/c++/14/bits/vector.tcc:700:5: note: parameter passing for argument of type ‘std::vector::iterator’ changed in GCC 7.1 2025-09-04T16:37:13,497 700 | vector<_Tp, _Alloc>:: 2025-09-04T16:37:13,498 | ^~~~~~~~~~~~~~~~~~~ 2025-09-04T16:37:15,311 In file included from /usr/include/c++/14/vector:66: 2025-09-04T16:37:15,312 In member function ‘void std::vector<_Tp, _Alloc>::resize(size_type, const value_type&) [with _Tp = double; _Alloc = std::allocator]’, 2025-09-04T16:37:15,312 inlined from ‘virtual void NetworKit::BFS::run(NetworKit::node)’ at networkit/cpp/graph/BFS.cpp:21:18: 2025-09-04T16:37:15,312 /usr/include/c++/14/bits/stl_vector.h:1037:25: note: parameter passing for argument of type ‘__gnu_cxx::__normal_iterator >’ changed in GCC 7.1 2025-09-04T16:37:15,312 1037 | _M_fill_insert(end(), __new_size - size(), __x); 2025-09-04T16:37:15,312 | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2025-09-04T16:37:20,398 ERROR: python setup.py bdist_wheel exited with 1 2025-09-04T16:37:20,409 [bold magenta]full command[/]: [blue]/usr/bin/python3 -u -c ' 2025-09-04T16:37:20,409 exec(compile('"'"''"'"''"'"' 2025-09-04T16:37:20,409 # This is -- a caller that pip uses to run setup.py 2025-09-04T16:37:20,409 # 2025-09-04T16:37:20,409 # - It imports setuptools before invoking setup.py, to enable projects that directly 2025-09-04T16:37:20,409 # import from `distutils.core` to work with newer packaging standards. 2025-09-04T16:37:20,409 # - It provides a clear error message when setuptools is not installed. 2025-09-04T16:37:20,409 # - It sets `sys.argv[0]` to the underlying `setup.py`, when invoking `setup.py` so 2025-09-04T16:37:20,409 # setuptools doesn'"'"'t think the script is `-c`. This avoids the following warning: 2025-09-04T16:37:20,409 # manifest_maker: standard file '"'"'-c'"'"' not found". 2025-09-04T16:37:20,409 # - It generates a shim setup.py, for handling setup.cfg-only projects. 2025-09-04T16:37:20,409 import os, sys, tokenize, traceback 2025-09-04T16:37:20,409 2025-09-04T16:37:20,409 try: 2025-09-04T16:37:20,409 import setuptools 2025-09-04T16:37:20,409 except ImportError: 2025-09-04T16:37:20,409 print( 2025-09-04T16:37:20,409 "ERROR: Can not execute `setup.py` since setuptools failed to import in " 2025-09-04T16:37:20,409 "the build environment with exception:", 2025-09-04T16:37:20,409 file=sys.stderr, 2025-09-04T16:37:20,409 ) 2025-09-04T16:37:20,409 traceback.print_exc() 2025-09-04T16:37:20,409 sys.exit(1) 2025-09-04T16:37:20,409 2025-09-04T16:37:20,409 __file__ = %r 2025-09-04T16:37:20,409 sys.argv[0] = __file__ 2025-09-04T16:37:20,409 2025-09-04T16:37:20,409 if os.path.exists(__file__): 2025-09-04T16:37:20,409 filename = __file__ 2025-09-04T16:37:20,409 with tokenize.open(__file__) as f: 2025-09-04T16:37:20,409 setup_py_code = f.read() 2025-09-04T16:37:20,409 else: 2025-09-04T16:37:20,409 filename = "" 2025-09-04T16:37:20,409 setup_py_code = "from setuptools import setup; setup()" 2025-09-04T16:37:20,409 2025-09-04T16:37:20,409 exec(compile(setup_py_code, filename, "exec")) 2025-09-04T16:37:20,409 '"'"''"'"''"'"' % ('"'"'/tmp/pip-wheel-yhdilmwe/networkit_93c8151e30bd4b219786e7267f52f2ca/setup.py'"'"',), "", "exec"))' bdist_wheel -d /tmp/pip-wheel-zbhuj6hy[/] 2025-09-04T16:37:20,409 [bold magenta]cwd[/]: /tmp/pip-wheel-yhdilmwe/networkit_93c8151e30bd4b219786e7267f52f2ca/ 2025-09-04T16:37:20,409 Building wheel for networkit (setup.py): finished with status 'error' 2025-09-04T16:37:20,410 ERROR: Failed building wheel for networkit 2025-09-04T16:37:20,411 Running setup.py clean for networkit 2025-09-04T16:37:20,411 Running command python setup.py clean 2025-09-04T16:37:20,993 /tmp/pip-wheel-yhdilmwe/networkit_93c8151e30bd4b219786e7267f52f2ca/setup.py:10: SetuptoolsDeprecationWarning: The test command is disabled and references to it are deprecated. 2025-09-04T16:37:20,994 !! 2025-09-04T16:37:20,994 ******************************************************************************** 2025-09-04T16:37:20,994 Please remove any references to `setuptools.command.test` in all supported versions of the affected package. 2025-09-04T16:37:20,994 This deprecation is overdue, please update your project and remove deprecated 2025-09-04T16:37:20,994 calls to avoid build errors in the future. 2025-09-04T16:37:20,994 ******************************************************************************** 2025-09-04T16:37:20,994 !! 2025-09-04T16:37:20,995 from setuptools.command.test import test as TestCommand 2025-09-04T16:37:21,355 /tmp/pip-wheel-yhdilmwe/networkit_93c8151e30bd4b219786e7267f52f2ca/setup.py:24: DeprecationWarning: distutils Version classes are deprecated. Use packaging.version instead. 2025-09-04T16:37:21,355 if LooseVersion(Cython.__version__) >= LooseVersion('0.21'): 2025-09-04T16:37:22,818 /usr/local/lib/python3.13/dist-packages/setuptools/_distutils/dist.py:289: UserWarning: Unknown distribution option: 'test_suite' 2025-09-04T16:37:22,819 warnings.warn(msg) 2025-09-04T16:37:23,032 /usr/local/lib/python3.13/dist-packages/setuptools/dist.py:759: SetuptoolsDeprecationWarning: License classifiers are deprecated. 2025-09-04T16:37:23,032 !! 2025-09-04T16:37:23,032 ******************************************************************************** 2025-09-04T16:37:23,032 Please consider removing the following classifiers in favor of a SPDX license expression: 2025-09-04T16:37:23,032 License :: OSI Approved :: MIT License 2025-09-04T16:37:23,033 See https://packaging.python.org/en/latest/guides/writing-pyproject-toml/#license for details. 2025-09-04T16:37:23,033 ******************************************************************************** 2025-09-04T16:37:23,033 !! 2025-09-04T16:37:23,033 self._finalize_license_expression() 2025-09-04T16:37:23,109 running clean 2025-09-04T16:37:23,257 removing 'build/lib.linux-armv7l-cpython-313' (and everything under it) 2025-09-04T16:37:23,259 'build/bdist.linux-armv7l' does not exist -- can't clean it 2025-09-04T16:37:23,260 'build/scripts-3.13' does not exist -- can't clean it 2025-09-04T16:37:23,260 removing 'build' 2025-09-04T16:37:23,385 Failed to build networkit 2025-09-04T16:37:23,386 ERROR: Failed to build one or more wheels 2025-09-04T16:37:23,387 Exception information: 2025-09-04T16:37:23,387 Traceback (most recent call last): 2025-09-04T16:37:23,387 File "/usr/lib/python3/dist-packages/pip/_internal/cli/base_command.py", line 105, in _run_wrapper 2025-09-04T16:37:23,387 status = _inner_run() 2025-09-04T16:37:23,387 File "/usr/lib/python3/dist-packages/pip/_internal/cli/base_command.py", line 96, in _inner_run 2025-09-04T16:37:23,387 return self.run(options, args) 2025-09-04T16:37:23,387 ~~~~~~~~^^^^^^^^^^^^^^^ 2025-09-04T16:37:23,387 File "/usr/lib/python3/dist-packages/pip/_internal/cli/req_command.py", line 68, in wrapper 2025-09-04T16:37:23,387 return func(self, options, args) 2025-09-04T16:37:23,387 File "/usr/lib/python3/dist-packages/pip/_internal/commands/wheel.py", line 180, in run 2025-09-04T16:37:23,387 raise CommandError("Failed to build one or more wheels") 2025-09-04T16:37:23,387 pip._internal.exceptions.CommandError: Failed to build one or more wheels 2025-09-04T16:37:23,392 Removed build tracker: '/tmp/pip-build-tracker-42rsn5ec'