Build: x86_64/community
Name: python-networkx-2.7-1
author: Qontinuum
email: qontinuum at artixlinux.org
[1]https://orion.artixlinux.org/job/packagesPython/job/python-networkx/
job/master/12/
References
1. https://orion.artixlinux.org/job/packagesPython/job/python-networkx/job/master/12/
-------------- next part --------------
Push event to branch master
Looking up repository packagesPython/python-networkx
Querying the current revision of branch master...
Current revision of branch master is a179f4908932790123917115b904b2ff76a1b276
Obtained Jenkinsfile from a179f4908932790123917115b904b2ff76a1b276
Loading library artix-ci at master
Attempting to resolve master from remote references...
> git --version # timeout=10
> git --version # 'git version 2.32.0'
> git ls-remote -- https://gitea.artixlinux.org/artix/pipeline-libs.git # timeout=10
Found match: refs/heads/master revision d9ed61b32f86824fd57e33b28d07d6ad7820bf63
Selected Git installation does not exist. Using Default
The recommended git tool is: NONE
Warning: CredentialId "jenkins-gotea-token" could not be found.
Cloning the remote Git repository
Cloning with configured refspecs honoured and without tags
Cloning repository https://gitea.artixlinux.org/artix/pipeline-libs.git
> git init /var/lib/jenkins/workspace/gesPython_python-networkx_master at libs/d1b6e538991d6cf27c1f72e8cf4d6e290b22a9c93094b0e97e3a05b8d58db898 # timeout=10
Fetching upstream changes from https://gitea.artixlinux.org/artix/pipeline-libs.git
> git --version # timeout=10
> git --version # 'git version 2.32.0'
> git fetch --no-tags --force --progress -- https://gitea.artixlinux.org/artix/pipeline-libs.git +refs/heads/master:refs/remotes/origin/master # timeout=10
> git config remote.origin.url https://gitea.artixlinux.org/artix/pipeline-libs.git # timeout=10
> git config --add remote.origin.fetch +refs/heads/master:refs/remotes/origin/master # timeout=10
Avoid second fetch
Checking out Revision d9ed61b32f86824fd57e33b28d07d6ad7820bf63 (master)
> git config core.sparsecheckout # timeout=10
> git checkout -f d9ed61b32f86824fd57e33b28d07d6ad7820bf63 # timeout=10
Commit message: "include version in build email subject"
[Gitea] Notifying branch build status: PENDING Build started...
[Gitea] Notified
[Pipeline] Start of Pipeline
[Pipeline] node
Still waiting to schedule task
Waiting for next available executor
Running on Jenkins in /var/lib/jenkins/workspace/gesPython_python-networkx_master
[Pipeline] {
[Pipeline] timestamps
[Pipeline] {
[Pipeline] stage
[Pipeline] { (Prepare)
[Pipeline] catchError
[Pipeline] {
[Pipeline] checkout
[2022-03-09T08:26:17.664Z] The recommended git tool is: NONE
[2022-03-09T08:26:17.665Z] Warning: CredentialId "jenkins-gotea-token" could not be found.
[2022-03-09T08:26:17.666Z] Cloning the remote Git repository
[2022-03-09T08:26:17.666Z] Cloning with configured refspecs honoured and without tags
[2022-03-09T08:26:17.666Z] Cloning repository https://[email protected]/packagesPython/python-networkx.git
[2022-03-09T08:26:17.666Z] > git init /var/lib/jenkins/workspace/gesPython_python-networkx_master # timeout=10
[2022-03-09T08:26:17.673Z] Fetching upstream changes from https://[email protected]/packagesPython/python-networkx.git
[2022-03-09T08:26:17.673Z] > git --version # timeout=10
[2022-03-09T08:26:17.676Z] > git --version # 'git version 2.32.0'
[2022-03-09T08:26:17.676Z] > git fetch --no-tags --force --progress -- https://[email protected]/packagesPython/python-networkx.git +refs/heads/master:refs/remotes/origin/master # timeout=10
[2022-03-09T08:26:17.868Z] > git config remote.origin.url https://[email protected]/packagesPython/python-networkx.git # timeout=10
[2022-03-09T08:26:17.871Z] > git config --add remote.origin.fetch +refs/heads/master:refs/remotes/origin/master # timeout=10
[2022-03-09T08:26:17.874Z] Avoid second fetch
[2022-03-09T08:26:17.875Z] Checking out Revision a179f4908932790123917115b904b2ff76a1b276 (master)
[2022-03-09T08:26:17.875Z] > git config core.sparsecheckout # timeout=10
[2022-03-09T08:26:17.878Z] > git checkout -f a179f4908932790123917115b904b2ff76a1b276 # timeout=10
[2022-03-09T08:26:17.883Z] Commit message: "[trunk] -> [community] 'python-networkx-2.7-1' add"
[2022-03-09T08:26:17.884Z] > git rev-list --no-walk 24301f73e0efbf0a93c04682af364931c3f193f5 # timeout=10
[2022-03-09T08:26:17.891Z] Cleaning workspace
[2022-03-09T08:26:17.891Z] > git rev-parse --verify HEAD # timeout=10
[2022-03-09T08:26:17.894Z] Resetting working tree
[2022-03-09T08:26:17.894Z] > git reset --hard # timeout=10
[2022-03-09T08:26:17.898Z] > git clean -fdx # timeout=10
[2022-03-09T08:26:17.901Z] [Gitea] Notifying branch build status: PENDING Build started...
[2022-03-09T08:26:18.005Z] [Gitea] Notified
[Pipeline] libraryResource
[Pipeline] readYaml
[Pipeline] sh
[2022-03-09T08:26:18.268Z] + git show -s --format=%an a179f4908932790123917115b904b2ff76a1b276
[Pipeline] sh
[2022-03-09T08:26:18.524Z] + git show -s --format=%ae a179f4908932790123917115b904b2ff76a1b276
[Pipeline] sh
[2022-03-09T08:26:18.780Z] + git show --pretty=format: --name-status a179f4908932790123917115b904b2ff76a1b276
[Pipeline] fileExists
[Pipeline] sh
[2022-03-09T08:26:19.053Z] + pkg2yaml -d x86_64/community
[Pipeline] readYaml
[Pipeline] }
[Pipeline] // catchError
[Pipeline] }
[Pipeline] // stage
[Pipeline] stage
[Pipeline] { (Build)
[Pipeline] withCredentials
[2022-03-09T08:26:19.124Z] Masking supported pattern matches of $BUILDBOT_GPGP
[Pipeline] {
[Pipeline] dir
[2022-03-09T08:26:19.150Z] Running in /var/lib/jenkins/workspace/gesPython_python-networkx_master/x86_64/community
[Pipeline] {
[Pipeline] catchError
[Pipeline] {
[Pipeline] sh
[2022-03-09T08:26:19.415Z] + buildpkg -C -d galaxy
[2022-03-09T08:26:21.898Z] :: Synchronizing package databases...
[2022-03-09T08:26:21.898Z] system downloading...
[2022-03-09T08:26:21.898Z] world downloading...
[2022-03-09T08:26:21.898Z] galaxy downloading...
[2022-03-09T08:26:21.898Z] :: Starting full system upgrade...
[2022-03-09T08:26:21.898Z] there is nothing to do
[2022-03-09T08:26:23.759Z] ==> Building in chroot for [default] (x86_64)...
[2022-03-09T08:26:24.310Z] ==> Synchronizing chroot copy [/build/buildpkg/default-x86_64/root] -> [jenkins]...done
[2022-03-09T08:26:24.860Z] ==> Making package: python-networkx 2.7-1 (Wed Mar 9 09:26:24 2022)
[2022-03-09T08:26:24.860Z] ==> Retrieving sources...
[2022-03-09T08:26:24.860Z] -> Downloading networkx-2.7.tar.gz...
[2022-03-09T08:26:24.860Z] % Total % Received % Xferd Average Speed Time Time Time Current
[2022-03-09T08:26:24.860Z] Dload Upload Total Spent Left Speed
[2022-03-09T08:26:24.860Z]
0 0 0 0 0 0 0 0 --:--:-- --:--:-- --:--:-- 0
100 141 100 141 0 0 757 0 --:--:-- --:--:-- --:--:-- 762
[2022-03-09T08:26:25.411Z]
100 1983k 0 1983k 0 0 2819k 0 --:--:-- --:--:-- --:--:-- 2819k
[2022-03-09T08:26:25.411Z] ==> Validating source files with sha512sums...
[2022-03-09T08:26:25.411Z] networkx-2.7.tar.gz ... Passed
[2022-03-09T08:26:28.638Z] ==> Making package: python-networkx 2.7-1 (Wed 09 Mar 2022 08:26:28 AM UTC)
[2022-03-09T08:26:28.638Z] ==> Checking runtime dependencies...
[2022-03-09T08:26:28.638Z] ==> Installing missing dependencies...
[2022-03-09T08:26:28.888Z] resolving dependencies...
[2022-03-09T08:26:28.888Z] looking for conflicting packages...
[2022-03-09T08:26:28.888Z] warning: dependency cycle detected:
[2022-03-09T08:26:28.888Z] warning: harfbuzz will be installed before its freetype2 dependency
[2022-03-09T08:26:28.888Z]
[2022-03-09T08:26:28.888Z] Package (38) New Version Net Change Download Size
[2022-03-09T08:26:28.888Z]
[2022-03-09T08:26:28.888Z] world/blas 3.10.0-1 0.33 MiB
[2022-03-09T08:26:28.888Z] world/cblas 3.10.0-1 0.20 MiB
[2022-03-09T08:26:28.888Z] world/freetype2 2.11.1-1 1.59 MiB
[2022-03-09T08:26:28.888Z] world/fribidi 1.0.11-1 0.22 MiB
[2022-03-09T08:26:28.888Z] world/graphite 1:1.3.14-1.1 0.69 MiB
[2022-03-09T08:26:28.889Z] world/harfbuzz 4.0.0-1 5.78 MiB
[2022-03-09T08:26:28.889Z] world/lapack 3.10.0-1 7.18 MiB
[2022-03-09T08:26:28.889Z] world/lcms2 2.13.1-1 0.66 MiB
[2022-03-09T08:26:28.889Z] galaxy/libimagequant 2.17.0-3 0.10 MiB
[2022-03-09T08:26:28.889Z] world/libjpeg-turbo 2.1.3-1 2.02 MiB
[2022-03-09T08:26:28.889Z] system/libnsl 2.0.0-2 0.07 MiB
[2022-03-09T08:26:28.889Z] world/libpng 1.6.37-3 0.55 MiB
[2022-03-09T08:26:28.889Z] world/libraqm 0.9.0-1 0.15 MiB
[2022-03-09T08:26:28.889Z] world/libtiff 4.3.0-1 2.82 MiB
[2022-03-09T08:26:28.889Z] world/libxau 1.0.9-3.1 0.02 MiB
[2022-03-09T08:26:28.889Z] world/libxcb 1.14-1.1 3.76 MiB
[2022-03-09T08:26:28.889Z] world/libxdmcp 1.1.3-3.1 0.13 MiB
[2022-03-09T08:26:28.889Z] world/openjpeg2 2.4.0-1 14.04 MiB
[2022-03-09T08:26:28.889Z] system/python 3.10.2-1 53.85 MiB
[2022-03-09T08:26:28.889Z] world/python-appdirs 1.4.4-6 0.07 MiB
[2022-03-09T08:26:28.889Z] galaxy/python-cycler 0.10.0-10 0.05 MiB
[2022-03-09T08:26:28.889Z] galaxy/python-dateutil 2.8.2-4 0.82 MiB
[2022-03-09T08:26:28.889Z] galaxy/python-fonttools 4.29.1-1 8.73 MiB
[2022-03-09T08:26:28.889Z] galaxy/python-kiwisolver 1.3.2-3 0.16 MiB
[2022-03-09T08:26:28.889Z] galaxy/python-more-itertools 8.10.0-4 0.32 MiB
[2022-03-09T08:26:28.889Z] world/python-ordered-set 4.0.2-6 0.06 MiB
[2022-03-09T08:26:28.889Z] world/python-packaging 20.9-7 0.18 MiB
[2022-03-09T08:26:28.889Z] galaxy/python-pillow 9.0.1-1 2.93 MiB
[2022-03-09T08:26:28.889Z] world/python-pyparsing 3.0.1-1 0.93 MiB
[2022-03-09T08:26:28.889Z] galaxy/python-pytz 2021.3-4 0.14 MiB
[2022-03-09T08:26:28.889Z] world/python-setuptools 1:59.3.0-1 2.96 MiB
[2022-03-09T08:26:28.889Z] world/python-six 1.16.0-5 0.09 MiB
[2022-03-09T08:26:28.889Z] world/qhull 2020.2-4 6.82 MiB
[2022-03-09T08:26:28.889Z] world/xcb-proto 1.14.1-5 0.82 MiB
[2022-03-09T08:26:28.889Z] galaxy/python-matplotlib 3.5.1-2.1 22.19 MiB
[2022-03-09T08:26:28.889Z] world/python-numpy 1.22.3-1 33.33 MiB 5.47 MiB
[2022-03-09T08:26:28.889Z] galaxy/python-pandas 1.4.1-1 62.47 MiB
[2022-03-09T08:26:28.889Z] galaxy/python-scipy 1.8.0-1 70.51 MiB
[2022-03-09T08:26:28.889Z]
[2022-03-09T08:26:28.889Z] Total Download Size: 5.47 MiB
[2022-03-09T08:26:28.889Z] Total Installed Size: 307.74 MiB
[2022-03-09T08:26:28.889Z]
[2022-03-09T08:26:28.889Z] :: Proceed with installation? [Y/n]
[2022-03-09T08:26:28.889Z] :: Retrieving packages...
[2022-03-09T08:26:28.889Z] python-numpy-1.22.3-1-x86_64 downloading...
[2022-03-09T08:26:28.889Z] checking keyring...
[2022-03-09T08:26:28.889Z] checking package integrity...
[2022-03-09T08:26:29.800Z] loading package files...
[2022-03-09T08:26:29.800Z] checking for file conflicts...
[2022-03-09T08:26:30.050Z] :: Processing package changes...
[2022-03-09T08:26:30.050Z] installing blas...
[2022-03-09T08:26:30.050Z] installing cblas...
[2022-03-09T08:26:30.050Z] installing lapack...
[2022-03-09T08:26:30.050Z] installing libnsl...
[2022-03-09T08:26:30.050Z] installing python...
[2022-03-09T08:26:30.300Z] Optional dependencies for python
[2022-03-09T08:26:30.300Z] python-setuptools [pending]
[2022-03-09T08:26:30.300Z] python-pip
[2022-03-09T08:26:30.300Z] sqlite [installed]
[2022-03-09T08:26:30.300Z] mpdecimal: for decimal
[2022-03-09T08:26:30.300Z] xz: for lzma [installed]
[2022-03-09T08:26:30.300Z] tk: for tkinter
[2022-03-09T08:26:30.300Z] installing python-numpy...
[2022-03-09T08:26:30.300Z] Optional dependencies for python-numpy
[2022-03-09T08:26:30.300Z] openblas: faster linear algebra
[2022-03-09T08:26:30.300Z] installing python-scipy...
[2022-03-09T08:26:30.851Z] Optional dependencies for python-scipy
[2022-03-09T08:26:30.851Z] python-pillow: for image saving module [pending]
[2022-03-09T08:26:30.851Z] installing libpng...
[2022-03-09T08:26:30.851Z] installing graphite...
[2022-03-09T08:26:30.851Z] installing harfbuzz...
[2022-03-09T08:26:30.851Z] Optional dependencies for harfbuzz
[2022-03-09T08:26:30.851Z] cairo: hb-view program
[2022-03-09T08:26:30.851Z] chafa: hb-view program
[2022-03-09T08:26:30.851Z] installing freetype2...
[2022-03-09T08:26:30.851Z] installing python-six...
[2022-03-09T08:26:30.851Z] installing python-cycler...
[2022-03-09T08:26:30.851Z] installing python-dateutil...
[2022-03-09T08:26:30.851Z] installing python-fonttools...
[2022-03-09T08:26:30.851Z] Optional dependencies for python-fonttools
[2022-03-09T08:26:30.851Z] python-brotli: to compress/decompress WOFF 2.0 web fonts
[2022-03-09T08:26:30.851Z] python-fs: to read/write UFO source files
[2022-03-09T08:26:30.851Z] python-lxml: faster backend for XML files reading/writing
[2022-03-09T08:26:30.851Z] python-lz4: for graphite type tables in ttLib/tables
[2022-03-09T08:26:30.851Z] python-matplotlib: for visualizing DesignSpaceDocument and resulting VariationModel [pending]
[2022-03-09T08:26:30.851Z] python-pyqt5: for drawing glyphs with Qt’s QPainterPath
[2022-03-09T08:26:30.851Z] python-reportlab: to drawing glyphs as PNG images
[2022-03-09T08:26:30.851Z] python-scipy: for finding wrong contour/component order between different masters [installed]
[2022-03-09T08:26:30.851Z] python-sympy: for symbolic font statistics analysis
[2022-03-09T08:26:30.851Z] python-unicodedata2: for displaying the Unicode character names when dumping the cmap table with ttx
[2022-03-09T08:26:30.851Z] python-zopfli: faster backend fom WOFF 1.0 web fonts compression
[2022-03-09T08:26:30.851Z] installing python-kiwisolver...
[2022-03-09T08:26:30.851Z] installing python-pyparsing...
[2022-03-09T08:26:30.851Z] Optional dependencies for python-pyparsing
[2022-03-09T08:26:30.851Z] python-railroad-diagrams: for generating Railroad Diagrams
[2022-03-09T08:26:30.851Z] python-jinja: for generating Railroad Diagrams
[2022-03-09T08:26:30.851Z] installing python-packaging...
[2022-03-09T08:26:30.851Z] installing libjpeg-turbo...
[2022-03-09T08:26:30.851Z] Optional dependencies for libjpeg-turbo
[2022-03-09T08:26:30.851Z] java-runtime>11: for TurboJPEG Java wrapper
[2022-03-09T08:26:30.851Z] installing libtiff...
[2022-03-09T08:26:30.851Z] Optional dependencies for libtiff
[2022-03-09T08:26:30.851Z] freeglut: for using tiffgt
[2022-03-09T08:26:30.851Z] installing lcms2...
[2022-03-09T08:26:30.851Z] installing fribidi...
[2022-03-09T08:26:30.851Z] installing libraqm...
[2022-03-09T08:26:30.851Z] installing openjpeg2...
[2022-03-09T08:26:30.851Z] installing libimagequant...
[2022-03-09T08:26:30.851Z] installing xcb-proto...
[2022-03-09T08:26:30.851Z] installing libxdmcp...
[2022-03-09T08:26:30.851Z] installing libxau...
[2022-03-09T08:26:30.851Z] installing libxcb...
[2022-03-09T08:26:31.102Z] installing python-pillow...
[2022-03-09T08:26:31.102Z] Optional dependencies for python-pillow
[2022-03-09T08:26:31.102Z] libwebp: for webp images
[2022-03-09T08:26:31.102Z] tk: for the ImageTK module
[2022-03-09T08:26:31.102Z] python-olefile: OLE2 file support
[2022-03-09T08:26:31.102Z] python-pyqt5: for the ImageQt module
[2022-03-09T08:26:31.102Z] installing qhull...
[2022-03-09T08:26:31.102Z] installing python-matplotlib...
[2022-03-09T08:26:31.102Z] Optional dependencies for python-matplotlib
[2022-03-09T08:26:31.102Z] tk: Tk{Agg,Cairo} backends
[2022-03-09T08:26:31.102Z] pyside2: alternative for Qt5{Agg,Cairo} backends
[2022-03-09T08:26:31.102Z] pyside6: alternative for Qt6{Agg,Cairo} backends
[2022-03-09T08:26:31.102Z] python-pyqt5: Qt5{Agg,Cairo} backends
[2022-03-09T08:26:31.102Z] python-pyqt6: Qt6{Agg,Cairo} backends
[2022-03-09T08:26:31.102Z] python-gobject: for GTK{3,4}{Agg,Cairo} backend
[2022-03-09T08:26:31.102Z] python-wxpython: WX{Agg,Cairo} backend
[2022-03-09T08:26:31.102Z] python-cairo: {GTK{3,4},Qt{5,6},Tk,WX}Cairo backends
[2022-03-09T08:26:31.102Z] python-tornado: WebAgg backend
[2022-03-09T08:26:31.102Z] ffmpeg: for saving movies
[2022-03-09T08:26:31.102Z] imagemagick: for saving animated gifs
[2022-03-09T08:26:31.102Z] ghostscript: usetex dependencies
[2022-03-09T08:26:31.102Z] texlive-bin: usetex dependencies
[2022-03-09T08:26:31.102Z] texlive-latexextra: usetex usage with pdflatex
[2022-03-09T08:26:31.102Z] python-certifi: https support
[2022-03-09T08:26:31.102Z] installing python-pytz...
[2022-03-09T08:26:31.102Z] installing python-appdirs...
[2022-03-09T08:26:31.102Z] installing python-more-itertools...
[2022-03-09T08:26:31.102Z] installing python-ordered-set...
[2022-03-09T08:26:31.102Z] installing python-setuptools...
[2022-03-09T08:26:31.102Z] installing python-pandas...
[2022-03-09T08:26:31.653Z] Optional dependencies for python-pandas
[2022-03-09T08:26:31.653Z] python-pandas-datareader: pandas.io.data replacement (recommended)
[2022-03-09T08:26:31.654Z] python-numexpr: needed for accelerating certain numerical operations (recommended)
[2022-03-09T08:26:31.654Z] python-bottleneck: needed for accelerating certain types of nan evaluations (recommended)
[2022-03-09T08:26:31.654Z] python-beautifulsoup4: needed for read_html function
[2022-03-09T08:26:31.654Z] python-jinja: needed for conditional HTML formatting
[2022-03-09T08:26:31.654Z] python-pyqt5: needed for read_clipboard function (only one needed)
[2022-03-09T08:26:31.654Z] python-pytables: needed for HDF5-based storage
[2022-03-09T08:26:31.654Z] python-sqlalchemy: needed for SQL database support
[2022-03-09T08:26:31.654Z] python-scipy: needed for miscellaneous statistical functions [installed]
[2022-03-09T08:26:31.654Z] python-xlsxwriter: alternative Excel XLSX output
[2022-03-09T08:26:31.654Z] python-blosc: for msgpack compression using blosc
[2022-03-09T08:26:31.654Z] python-html5lib: needed for read_hmlt function (and/or python-lxml)
[2022-03-09T08:26:31.654Z] python-lxml: needed for read_html function (and/or python-html5lib)
[2022-03-09T08:26:31.654Z] python-matplotlib: needed for plotting [installed]
[2022-03-09T08:26:31.654Z] python-openpyxl: needed for Excel XLSX input/output
[2022-03-09T08:26:31.654Z] python-psycopg2: needed for PostgreSQL engine for sqlalchemy
[2022-03-09T08:26:31.654Z] python-pymysql: needed for MySQL engine for sqlalchemy
[2022-03-09T08:26:31.654Z] python-qtpy: needed for read_clipboard function (only one needed)
[2022-03-09T08:26:31.654Z] python-tabulate: needed for printing in Markdown-friendly format
[2022-03-09T08:26:31.654Z] python-fsspec: needed for handling files aside from local and HTTP
[2022-03-09T08:26:31.654Z] xclip: needed for read_clipboard function (only one needed)
[2022-03-09T08:26:31.654Z] python-xlrd: needed for Excel XLS input
[2022-03-09T08:26:31.654Z] python-xlwt: needed for Excel XLS output
[2022-03-09T08:26:31.654Z] xsel: needed for read_clipboard function (only one needed)
[2022-03-09T08:26:31.654Z] zlib: needed for compression for msgpack [installed]
[2022-03-09T08:26:31.654Z] ==> Checking buildtime dependencies...
[2022-03-09T08:26:31.654Z] ==> Installing missing dependencies...
[2022-03-09T08:26:31.904Z] resolving dependencies...
[2022-03-09T08:26:31.904Z] looking for conflicting packages...
[2022-03-09T08:26:31.904Z]
[2022-03-09T08:26:31.904Z] Package (64) New Version Net Change
[2022-03-09T08:26:31.904Z]
[2022-03-09T08:26:31.904Z] world/aom 3.3.0-1 8.95 MiB
[2022-03-09T08:26:31.904Z] world/avahi 0.8+22+gfd482a7-3 1.85 MiB
[2022-03-09T08:26:31.904Z] world/cairo 1.17.4-5 1.68 MiB
[2022-03-09T08:26:31.904Z] world/dav1d 0.9.2-1 1.36 MiB
[2022-03-09T08:26:31.904Z] system/dbus 1.14.0-1 0.96 MiB
[2022-03-09T08:26:31.904Z] world/fontconfig 2:2.13.96-1 1.06 MiB
[2022-03-09T08:26:31.904Z] world/gd 2.3.3-3.1 0.67 MiB
[2022-03-09T08:26:31.904Z] world/gdk-pixbuf2 2.42.6-2 2.96 MiB
[2022-03-09T08:26:31.904Z] world/ghostscript 9.55.0-4 44.17 MiB
[2022-03-09T08:26:31.904Z] world/giflib 5.2.1-2.1 0.30 MiB
[2022-03-09T08:26:31.904Z] world/graphviz 2.50.0-2 9.99 MiB
[2022-03-09T08:26:31.904Z] world/gsfonts 20200910-2 3.11 MiB
[2022-03-09T08:26:31.904Z] world/gts 0.7.6.121130-2.1 0.67 MiB
[2022-03-09T08:26:31.904Z] world/ijs 0.35-3.1 0.12 MiB
[2022-03-09T08:26:31.904Z] world/jbig2dec 0.19-1 0.15 MiB
[2022-03-09T08:26:31.904Z] galaxy/libavif 0.9.3-1 0.32 MiB
[2022-03-09T08:26:31.904Z] world/libcups 1:2.4.1-1 0.82 MiB
[2022-03-09T08:26:31.904Z] world/libdaemon 0.14-5.1 0.06 MiB
[2022-03-09T08:26:31.904Z] world/libdatrie 0.2.13-1 0.07 MiB
[2022-03-09T08:26:31.904Z] world/libde265 1.0.8-2 1.15 MiB
[2022-03-09T08:26:31.904Z] system/libelogind 246.10-5 0.58 MiB
[2022-03-09T08:26:31.904Z] world/libheif 1.12.0-3 0.84 MiB
[2022-03-09T08:26:31.904Z] world/libice 1.0.10-3.1 0.35 MiB
[2022-03-09T08:26:31.904Z] world/libidn 1.38-1 0.75 MiB
[2022-03-09T08:26:31.904Z] world/libpaper 1.1.28-1.1 0.09 MiB
[2022-03-09T08:26:31.904Z] world/librsvg 2:2.52.6-1 14.55 MiB
[2022-03-09T08:26:31.904Z] world/libsm 1.2.3-2.1 0.26 MiB
[2022-03-09T08:26:31.904Z] world/libthai 0.1.29-1 0.65 MiB
[2022-03-09T08:26:31.904Z] system/libusb 1.0.25-2 0.21 MiB
[2022-03-09T08:26:31.904Z] world/libwebp 1.2.2-1 1.07 MiB
[2022-03-09T08:26:31.904Z] world/libx11 1.7.3.1-1 10.17 MiB
[2022-03-09T08:26:31.904Z] world/libxaw 1.0.14-1 1.69 MiB
[2022-03-09T08:26:31.904Z] world/libxext 1.3.4-3.1 0.30 MiB
[2022-03-09T08:26:31.904Z] world/libxft 2.3.4-1 0.12 MiB
[2022-03-09T08:26:31.904Z] world/libxmu 1.1.3-2.1 0.33 MiB
[2022-03-09T08:26:31.904Z] world/libxpm 3.5.13-2.1 0.16 MiB
[2022-03-09T08:26:31.904Z] world/libxrender 0.9.10-4.1 0.08 MiB
[2022-03-09T08:26:31.904Z] world/libxslt 1.1.35-1 2.81 MiB
[2022-03-09T08:26:31.904Z] world/libxt 1.2.1-1 2.03 MiB
[2022-03-09T08:26:31.904Z] world/libyaml 0.2.5-1.1 0.18 MiB
[2022-03-09T08:26:31.904Z] galaxy/libyuv r2266+eb6e7bb6-1 1.47 MiB
[2022-03-09T08:26:31.904Z] system/lzo 2.10-3.1 0.38 MiB
[2022-03-09T08:26:31.904Z] world/netpbm 10.73.37-1 7.49 MiB
[2022-03-09T08:26:31.904Z] world/pango 1:1.50.5-1 2.27 MiB
[2022-03-09T08:26:31.904Z] world/pixman 0.40.0-1.1 0.72 MiB
[2022-03-09T08:26:31.904Z] galaxy/python-apipkg 2.1.0-1 0.03 MiB
[2022-03-09T08:26:31.904Z] world/python-attrs 21.4.0-1 0.45 MiB
[2022-03-09T08:26:31.904Z] galaxy/python-importlib-metadata 4.8.1-3 0.15 MiB
[2022-03-09T08:26:31.904Z] galaxy/python-iniconfig 1.1.1-5.1 0.02 MiB
[2022-03-09T08:26:31.904Z] galaxy/python-pluggy 0.13.1-8.1 0.12 MiB
[2022-03-09T08:26:31.904Z] galaxy/python-py 1.11.0-1.1 0.71 MiB
[2022-03-09T08:26:31.904Z] galaxy/python-pytest 7.0.1-1 2.63 MiB
[2022-03-09T08:26:31.904Z] world/python-tomli 2.0.0-1 0.06 MiB
[2022-03-09T08:26:31.904Z] galaxy/python-zipp 3.7.0-1 0.03 MiB
[2022-03-09T08:26:31.904Z] world/rav1e 0.4.1-1 5.80 MiB
[2022-03-09T08:26:31.904Z] system/run-parts 5.5-1 0.04 MiB
[2022-03-09T08:26:31.904Z] world/shared-mime-info 2.0+115+gd74a913-1 4.39 MiB
[2022-03-09T08:26:31.904Z] galaxy/svt-av1 0.8.6-2 6.00 MiB
[2022-03-09T08:26:31.904Z] world/x265 3.5-3 19.33 MiB
[2022-03-09T08:26:31.904Z] world/xorgproto 2021.5-1 1.43 MiB
[2022-03-09T08:26:31.904Z] world/python-lxml 4.7.1-1 4.19 MiB
[2022-03-09T08:26:31.904Z] galaxy/python-pydot 1.4.2-3 0.19 MiB
[2022-03-09T08:26:31.904Z] galaxy/python-pytest-runner 5.3.2-1 0.03 MiB
[2022-03-09T08:26:31.904Z] galaxy/python-yaml 6.0-1 0.74 MiB
[2022-03-09T08:26:31.904Z]
[2022-03-09T08:26:31.904Z] Total Installed Size: 176.28 MiB
[2022-03-09T08:26:31.904Z]
[2022-03-09T08:26:31.904Z] :: Proceed with installation? [Y/n]
[2022-03-09T08:26:31.904Z] checking keyring...
[2022-03-09T08:26:31.904Z] checking package integrity...
[2022-03-09T08:26:33.766Z] loading package files...
[2022-03-09T08:26:33.766Z] checking for file conflicts...
[2022-03-09T08:26:33.766Z] :: Processing package changes...
[2022-03-09T08:26:33.766Z] installing python-attrs...
[2022-03-09T08:26:33.766Z] installing python-iniconfig...
[2022-03-09T08:26:33.766Z] installing python-zipp...
[2022-03-09T08:26:33.766Z] installing python-importlib-metadata...
[2022-03-09T08:26:33.766Z] installing python-pluggy...
[2022-03-09T08:26:33.766Z] installing python-apipkg...
[2022-03-09T08:26:33.766Z] installing python-py...
[2022-03-09T08:26:33.766Z] installing python-tomli...
[2022-03-09T08:26:33.766Z] installing python-pytest...
[2022-03-09T08:26:33.766Z] installing python-pytest-runner...
[2022-03-09T08:26:33.766Z] installing libxslt...
[2022-03-09T08:26:33.766Z] Optional dependencies for libxslt
[2022-03-09T08:26:33.766Z] python: Python bindings [installed]
[2022-03-09T08:26:33.766Z] installing python-lxml...
[2022-03-09T08:26:33.766Z] Optional dependencies for python-lxml
[2022-03-09T08:26:33.766Z] python-beautifulsoup4: support for beautifulsoup parser to parse not well formed HTML
[2022-03-09T08:26:33.766Z] python-cssselect: support for cssselect
[2022-03-09T08:26:33.766Z] python-html5lib: support for html5lib parser
[2022-03-09T08:26:33.766Z] python-lxml-docs: offline docs
[2022-03-09T08:26:33.766Z] installing fontconfig...
[2022-03-09T08:26:33.766Z] Creating fontconfig configuration...
[2022-03-09T08:26:33.766Z] Rebuilding fontconfig cache...
[2022-03-09T08:26:33.766Z] installing libice...
[2022-03-09T08:26:33.766Z] installing libsm...
[2022-03-09T08:26:33.766Z] installing xorgproto...
[2022-03-09T08:26:33.766Z] installing libx11...
[2022-03-09T08:26:34.017Z] installing libxt...
[2022-03-09T08:26:34.017Z] installing libxext...
[2022-03-09T08:26:34.017Z] installing libxpm...
[2022-03-09T08:26:34.017Z] installing giflib...
[2022-03-09T08:26:34.017Z] installing libwebp...
[2022-03-09T08:26:34.017Z] Optional dependencies for libwebp
[2022-03-09T08:26:34.017Z] freeglut: vwebp viewer
[2022-03-09T08:26:34.017Z] installing aom...
[2022-03-09T08:26:34.017Z] installing dav1d...
[2022-03-09T08:26:34.017Z] Optional dependencies for dav1d
[2022-03-09T08:26:34.017Z] dav1d-doc: HTML documentation
[2022-03-09T08:26:34.017Z] installing rav1e...
[2022-03-09T08:26:34.017Z] installing svt-av1...
[2022-03-09T08:26:34.017Z] installing libyuv...
[2022-03-09T08:26:34.017Z] installing libavif...
[2022-03-09T08:26:34.017Z] installing libde265...
[2022-03-09T08:26:34.017Z] Optional dependencies for libde265
[2022-03-09T08:26:34.017Z] ffmpeg: for sherlock265
[2022-03-09T08:26:34.017Z] qt5-base: for sherlock265
[2022-03-09T08:26:34.017Z] sdl: dec265 YUV overlay output
[2022-03-09T08:26:34.017Z] installing x265...
[2022-03-09T08:26:34.017Z] installing libheif...
[2022-03-09T08:26:34.017Z] Optional dependencies for libheif
[2022-03-09T08:26:34.017Z] libjpeg: for heif-convert and heif-enc [installed]
[2022-03-09T08:26:34.017Z] libpng: for heif-convert and heif-enc [installed]
[2022-03-09T08:26:34.017Z] installing gd...
[2022-03-09T08:26:34.017Z] Optional dependencies for gd
[2022-03-09T08:26:34.017Z] perl: bdftogd script [installed]
[2022-03-09T08:26:34.017Z] installing shared-mime-info...
[2022-03-09T08:26:34.017Z] installing gdk-pixbuf2...
[2022-03-09T08:26:34.017Z] Optional dependencies for gdk-pixbuf2
[2022-03-09T08:26:34.017Z] libwmf: Load .wmf and .apm
[2022-03-09T08:26:34.017Z] libopenraw: Load .dng, .cr2, .crw, .nef, .orf, .pef, .arw, .erf, .mrw, and .raf
[2022-03-09T08:26:34.017Z] libavif: Load .avif [installed]
[2022-03-09T08:26:34.017Z] libheif: Load .heif, .heic, and .avif [installed]
[2022-03-09T08:26:34.017Z] librsvg: Load .svg, .svgz, and .svg.gz [pending]
[2022-03-09T08:26:34.017Z] webp-pixbuf-loader: Load .webp
[2022-03-09T08:26:34.017Z] installing libdatrie...
[2022-03-09T08:26:34.017Z] installing libthai...
[2022-03-09T08:26:34.017Z] installing lzo...
[2022-03-09T08:26:34.017Z] installing libxrender...
[2022-03-09T08:26:34.017Z] installing pixman...
[2022-03-09T08:26:34.017Z] installing cairo...
[2022-03-09T08:26:34.017Z] installing libxft...
[2022-03-09T08:26:34.017Z] installing pango...
[2022-03-09T08:26:34.017Z] installing librsvg...
[2022-03-09T08:26:34.267Z] installing libxmu...
[2022-03-09T08:26:34.267Z] installing libxaw...
[2022-03-09T08:26:34.267Z] installing libdaemon...
[2022-03-09T08:26:34.267Z] installing libelogind...
[2022-03-09T08:26:34.267Z] installing dbus...
[2022-03-09T08:26:34.267Z] installing avahi...
[2022-03-09T08:26:34.267Z] Optional dependencies for avahi
[2022-03-09T08:26:34.267Z] gtk3: avahi-discover, avahi-discover-standalone, bshell, bssh, bvnc
[2022-03-09T08:26:34.267Z] qt5-base: qt5 bindings
[2022-03-09T08:26:34.267Z] libevent: libevent bindings
[2022-03-09T08:26:34.267Z] nss-mdns: NSS support for mDNS
[2022-03-09T08:26:34.267Z] python-twisted: avahi-bookmarks
[2022-03-09T08:26:34.267Z] python-gobject: avahi-bookmarks, avahi-discover
[2022-03-09T08:26:34.267Z] python-dbus: avahi-bookmarks, avahi-discover
[2022-03-09T08:26:34.267Z] installing libusb...
[2022-03-09T08:26:34.267Z] installing libcups...
[2022-03-09T08:26:34.267Z] installing jbig2dec...
[2022-03-09T08:26:34.267Z] installing run-parts...
[2022-03-09T08:26:34.267Z] installing libpaper...
[2022-03-09T08:26:34.267Z] installing ijs...
[2022-03-09T08:26:34.267Z] installing libidn...
[2022-03-09T08:26:34.267Z] installing ghostscript...
[2022-03-09T08:26:34.267Z] Optional dependencies for ghostscript
[2022-03-09T08:26:34.267Z] texlive-core: needed for dvipdf
[2022-03-09T08:26:34.267Z] gtk3: needed for gsx
[2022-03-09T08:26:34.267Z] installing netpbm...
[2022-03-09T08:26:34.518Z] installing gts...
[2022-03-09T08:26:34.518Z] installing gsfonts...
[2022-03-09T08:26:34.518Z] installing graphviz...
[2022-03-09T08:26:34.518Z] Warning: Could not load "/usr/lib/graphviz/libgvplugin_gdk.so.6" - It was found, so perhaps one of its dependents was not. Try ldd.
[2022-03-09T08:26:34.518Z] Warning: Could not load "/usr/lib/graphviz/libgvplugin_gtk.so.6" - It was found, so perhaps one of its dependents was not. Try ldd.
[2022-03-09T08:26:34.518Z] Warning: Could not load "/usr/lib/graphviz/libgvplugin_gdk.so.6" - It was found, so perhaps one of its dependents was not. Try ldd.
[2022-03-09T08:26:34.518Z] Warning: Could not load "/usr/lib/graphviz/libgvplugin_gtk.so.6" - It was found, so perhaps one of its dependents was not. Try ldd.
[2022-03-09T08:26:34.518Z] Optional dependencies for graphviz
[2022-03-09T08:26:34.518Z] mono: sharp bindings
[2022-03-09T08:26:34.518Z] guile: guile bindings [installed]
[2022-03-09T08:26:34.518Z] lua: lua bindings
[2022-03-09T08:26:34.518Z] ocaml: ocaml bindings
[2022-03-09T08:26:34.518Z] perl: perl bindings [installed]
[2022-03-09T08:26:34.518Z] python: python bindings [installed]
[2022-03-09T08:26:34.518Z] r: r bindings
[2022-03-09T08:26:34.518Z] tcl: tcl bindings
[2022-03-09T08:26:34.518Z] qt5-base: gvedit
[2022-03-09T08:26:34.518Z] gtk2: gtk output plugin
[2022-03-09T08:26:34.518Z] xterm: vimdot
[2022-03-09T08:26:34.518Z] installing python-pydot...
[2022-03-09T08:26:34.518Z] installing libyaml...
[2022-03-09T08:26:34.518Z] installing python-yaml...
[2022-03-09T08:26:34.518Z] :: Running post-transaction hooks...
[2022-03-09T08:26:34.518Z] (1/7) Creating system user accounts...
[2022-03-09T08:26:34.518Z] Creating group 'avahi' with GID 980.
[2022-03-09T08:26:34.518Z] Creating user 'avahi' (Avahi mDNS/DNS-SD daemon) with UID 980 and GID 980.
[2022-03-09T08:26:34.518Z] Creating group 'dbus' with GID 81.
[2022-03-09T08:26:34.518Z] Creating user 'dbus' (System Message Bus) with UID 81 and GID 81.
[2022-03-09T08:26:34.518Z] (2/7) Updating the MIME type database...
[2022-03-09T08:26:35.068Z] (3/7) Updating fontconfig configuration...
[2022-03-09T08:26:35.068Z] (4/7) Warn about old perl modules
[2022-03-09T08:26:35.068Z] (5/7) Updating fontconfig cache...
[2022-03-09T08:26:35.068Z] (6/7) Probing GDK-Pixbuf loader modules...
[2022-03-09T08:26:35.068Z] (7/7) Updating the info directory file...
[2022-03-09T08:26:35.068Z] ==> Retrieving sources...
[2022-03-09T08:26:35.068Z] -> Found networkx-2.7.tar.gz
[2022-03-09T08:26:35.068Z] ==> WARNING: Skipping all source file integrity checks.
[2022-03-09T08:26:35.068Z] ==> Extracting sources...
[2022-03-09T08:26:35.068Z] -> Extracting networkx-2.7.tar.gz with bsdtar
[2022-03-09T08:26:35.319Z] ==> Starting build()...
[2022-03-09T08:26:35.569Z] running build
[2022-03-09T08:26:35.569Z] running build_py
[2022-03-09T08:26:35.569Z] creating build
[2022-03-09T08:26:35.569Z] creating build/lib
[2022-03-09T08:26:35.569Z] creating build/lib/networkx
[2022-03-09T08:26:35.569Z] copying networkx/__init__.py -> build/lib/networkx
[2022-03-09T08:26:35.569Z] copying networkx/convert_matrix.py -> build/lib/networkx
[2022-03-09T08:26:35.569Z] copying networkx/relabel.py -> build/lib/networkx
[2022-03-09T08:26:35.569Z] copying networkx/convert.py -> build/lib/networkx
[2022-03-09T08:26:35.569Z] copying networkx/exception.py -> build/lib/networkx
[2022-03-09T08:26:35.569Z] copying networkx/conftest.py -> build/lib/networkx
[2022-03-09T08:26:35.569Z] copying networkx/lazy_imports.py -> build/lib/networkx
[2022-03-09T08:26:35.569Z] creating build/lib/networkx/algorithms
[2022-03-09T08:26:35.569Z] copying networkx/algorithms/smallworld.py -> build/lib/networkx/algorithms
[2022-03-09T08:26:35.569Z] copying networkx/algorithms/__init__.py -> build/lib/networkx/algorithms
[2022-03-09T08:26:35.569Z] copying networkx/algorithms/dominance.py -> build/lib/networkx/algorithms
[2022-03-09T08:26:35.569Z] copying networkx/algorithms/swap.py -> build/lib/networkx/algorithms
[2022-03-09T08:26:35.569Z] copying networkx/algorithms/covering.py -> build/lib/networkx/algorithms
[2022-03-09T08:26:35.569Z] copying networkx/algorithms/cluster.py -> build/lib/networkx/algorithms
[2022-03-09T08:26:35.569Z] copying networkx/algorithms/planar_drawing.py -> build/lib/networkx/algorithms
[2022-03-09T08:26:35.569Z] copying networkx/algorithms/mis.py -> build/lib/networkx/algorithms
[2022-03-09T08:26:35.569Z] copying networkx/algorithms/graphical.py -> build/lib/networkx/algorithms
[2022-03-09T08:26:35.569Z] copying networkx/algorithms/vitality.py -> build/lib/networkx/algorithms
[2022-03-09T08:26:35.569Z] copying networkx/algorithms/clique.py -> build/lib/networkx/algorithms
[2022-03-09T08:26:35.569Z] copying networkx/algorithms/reciprocity.py -> build/lib/networkx/algorithms
[2022-03-09T08:26:35.569Z] copying networkx/algorithms/core.py -> build/lib/networkx/algorithms
[2022-03-09T08:26:35.569Z] copying networkx/algorithms/asteroidal.py -> build/lib/networkx/algorithms
[2022-03-09T08:26:35.569Z] copying networkx/algorithms/planarity.py -> build/lib/networkx/algorithms
[2022-03-09T08:26:35.569Z] copying networkx/algorithms/lowest_common_ancestors.py -> build/lib/networkx/algorithms
[2022-03-09T08:26:35.569Z] copying networkx/algorithms/non_randomness.py -> build/lib/networkx/algorithms
[2022-03-09T08:26:35.569Z] copying networkx/algorithms/smetric.py -> build/lib/networkx/algorithms
[2022-03-09T08:26:35.570Z] copying networkx/algorithms/voronoi.py -> build/lib/networkx/algorithms
[2022-03-09T08:26:35.570Z] copying networkx/algorithms/link_prediction.py -> build/lib/networkx/algorithms
[2022-03-09T08:26:35.570Z] copying networkx/algorithms/moral.py -> build/lib/networkx/algorithms
[2022-03-09T08:26:35.570Z] copying networkx/algorithms/threshold.py -> build/lib/networkx/algorithms
[2022-03-09T08:26:35.570Z] copying networkx/algorithms/structuralholes.py -> build/lib/networkx/algorithms
[2022-03-09T08:26:35.570Z] copying networkx/algorithms/bridges.py -> build/lib/networkx/algorithms
[2022-03-09T08:26:35.570Z] copying networkx/algorithms/boundary.py -> build/lib/networkx/algorithms
[2022-03-09T08:26:35.570Z] copying networkx/algorithms/dominating.py -> build/lib/networkx/algorithms
[2022-03-09T08:26:35.570Z] copying networkx/algorithms/distance_regular.py -> build/lib/networkx/algorithms
[2022-03-09T08:26:35.570Z] copying networkx/algorithms/graph_hashing.py -> build/lib/networkx/algorithms
[2022-03-09T08:26:35.570Z] copying networkx/algorithms/chordal.py -> build/lib/networkx/algorithms
[2022-03-09T08:26:35.570Z] copying networkx/algorithms/similarity.py -> build/lib/networkx/algorithms
[2022-03-09T08:26:35.570Z] copying networkx/algorithms/distance_measures.py -> build/lib/networkx/algorithms
[2022-03-09T08:26:35.570Z] copying networkx/algorithms/hierarchy.py -> build/lib/networkx/algorithms
[2022-03-09T08:26:35.570Z] copying networkx/algorithms/efficiency_measures.py -> build/lib/networkx/algorithms
[2022-03-09T08:26:35.570Z] copying networkx/algorithms/euler.py -> build/lib/networkx/algorithms
[2022-03-09T08:26:35.570Z] copying networkx/algorithms/triads.py -> build/lib/networkx/algorithms
[2022-03-09T08:26:35.570Z] copying networkx/algorithms/hybrid.py -> build/lib/networkx/algorithms
[2022-03-09T08:26:35.570Z] copying networkx/algorithms/chains.py -> build/lib/networkx/algorithms
[2022-03-09T08:26:35.570Z] copying networkx/algorithms/cuts.py -> build/lib/networkx/algorithms
[2022-03-09T08:26:35.570Z] copying networkx/algorithms/dag.py -> build/lib/networkx/algorithms
[2022-03-09T08:26:35.570Z] copying networkx/algorithms/sparsifiers.py -> build/lib/networkx/algorithms
[2022-03-09T08:26:35.570Z] copying networkx/algorithms/matching.py -> build/lib/networkx/algorithms
[2022-03-09T08:26:35.570Z] copying networkx/algorithms/regular.py -> build/lib/networkx/algorithms
[2022-03-09T08:26:35.570Z] copying networkx/algorithms/communicability_alg.py -> build/lib/networkx/algorithms
[2022-03-09T08:26:35.570Z] copying networkx/algorithms/cycles.py -> build/lib/networkx/algorithms
[2022-03-09T08:26:35.570Z] copying networkx/algorithms/isolate.py -> build/lib/networkx/algorithms
[2022-03-09T08:26:35.570Z] copying networkx/algorithms/d_separation.py -> build/lib/networkx/algorithms
[2022-03-09T08:26:35.570Z] copying networkx/algorithms/summarization.py -> build/lib/networkx/algorithms
[2022-03-09T08:26:35.570Z] copying networkx/algorithms/simple_paths.py -> build/lib/networkx/algorithms
[2022-03-09T08:26:35.570Z] copying networkx/algorithms/wiener.py -> build/lib/networkx/algorithms
[2022-03-09T08:26:35.570Z] copying networkx/algorithms/tournament.py -> build/lib/networkx/algorithms
[2022-03-09T08:26:35.570Z] copying networkx/algorithms/richclub.py -> build/lib/networkx/algorithms
[2022-03-09T08:26:35.570Z] creating build/lib/networkx/algorithms/assortativity
[2022-03-09T08:26:35.570Z] copying networkx/algorithms/assortativity/__init__.py -> build/lib/networkx/algorithms/assortativity
[2022-03-09T08:26:35.570Z] copying networkx/algorithms/assortativity/neighbor_degree.py -> build/lib/networkx/algorithms/assortativity
[2022-03-09T08:26:35.570Z] copying networkx/algorithms/assortativity/pairs.py -> build/lib/networkx/algorithms/assortativity
[2022-03-09T08:26:35.570Z] copying networkx/algorithms/assortativity/connectivity.py -> build/lib/networkx/algorithms/assortativity
[2022-03-09T08:26:35.570Z] copying networkx/algorithms/assortativity/mixing.py -> build/lib/networkx/algorithms/assortativity
[2022-03-09T08:26:35.570Z] copying networkx/algorithms/assortativity/correlation.py -> build/lib/networkx/algorithms/assortativity
[2022-03-09T08:26:35.570Z] creating build/lib/networkx/algorithms/bipartite
[2022-03-09T08:26:35.570Z] copying networkx/algorithms/bipartite/__init__.py -> build/lib/networkx/algorithms/bipartite
[2022-03-09T08:26:35.570Z] copying networkx/algorithms/bipartite/covering.py -> build/lib/networkx/algorithms/bipartite
[2022-03-09T08:26:35.570Z] copying networkx/algorithms/bipartite/cluster.py -> build/lib/networkx/algorithms/bipartite
[2022-03-09T08:26:35.570Z] copying networkx/algorithms/bipartite/redundancy.py -> build/lib/networkx/algorithms/bipartite
[2022-03-09T08:26:35.570Z] copying networkx/algorithms/bipartite/spectral.py -> build/lib/networkx/algorithms/bipartite
[2022-03-09T08:26:35.570Z] copying networkx/algorithms/bipartite/generators.py -> build/lib/networkx/algorithms/bipartite
[2022-03-09T08:26:35.570Z] copying networkx/algorithms/bipartite/matrix.py -> build/lib/networkx/algorithms/bipartite
[2022-03-09T08:26:35.570Z] copying networkx/algorithms/bipartite/centrality.py -> build/lib/networkx/algorithms/bipartite
[2022-03-09T08:26:35.570Z] copying networkx/algorithms/bipartite/edgelist.py -> build/lib/networkx/algorithms/bipartite
[2022-03-09T08:26:35.570Z] copying networkx/algorithms/bipartite/matching.py -> build/lib/networkx/algorithms/bipartite
[2022-03-09T08:26:35.570Z] copying networkx/algorithms/bipartite/projection.py -> build/lib/networkx/algorithms/bipartite
[2022-03-09T08:26:35.570Z] copying networkx/algorithms/bipartite/basic.py -> build/lib/networkx/algorithms/bipartite
[2022-03-09T08:26:35.570Z] creating build/lib/networkx/algorithms/node_classification
[2022-03-09T08:26:35.571Z] copying networkx/algorithms/node_classification/__init__.py -> build/lib/networkx/algorithms/node_classification
[2022-03-09T08:26:35.571Z] copying networkx/algorithms/node_classification/lgc.py -> build/lib/networkx/algorithms/node_classification
[2022-03-09T08:26:35.571Z] copying networkx/algorithms/node_classification/hmn.py -> build/lib/networkx/algorithms/node_classification
[2022-03-09T08:26:35.571Z] copying networkx/algorithms/node_classification/utils.py -> build/lib/networkx/algorithms/node_classification
[2022-03-09T08:26:35.571Z] creating build/lib/networkx/algorithms/centrality
[2022-03-09T08:26:35.571Z] copying networkx/algorithms/centrality/dispersion.py -> build/lib/networkx/algorithms/centrality
[2022-03-09T08:26:35.571Z] copying networkx/algorithms/centrality/current_flow_betweenness.py -> build/lib/networkx/algorithms/centrality
[2022-03-09T08:26:35.571Z] copying networkx/algorithms/centrality/__init__.py -> build/lib/networkx/algorithms/centrality
[2022-03-09T08:26:35.571Z] copying networkx/algorithms/centrality/percolation.py -> build/lib/networkx/algorithms/centrality
[2022-03-09T08:26:35.571Z] copying networkx/algorithms/centrality/reaching.py -> build/lib/networkx/algorithms/centrality
[2022-03-09T08:26:35.571Z] copying networkx/algorithms/centrality/subgraph_alg.py -> build/lib/networkx/algorithms/centrality
[2022-03-09T08:26:35.571Z] copying networkx/algorithms/centrality/katz.py -> build/lib/networkx/algorithms/centrality
[2022-03-09T08:26:35.571Z] copying networkx/algorithms/centrality/current_flow_betweenness_subset.py -> build/lib/networkx/algorithms/centrality
[2022-03-09T08:26:35.571Z] copying networkx/algorithms/centrality/harmonic.py -> build/lib/networkx/algorithms/centrality
[2022-03-09T08:26:35.571Z] copying networkx/algorithms/centrality/betweenness.py -> build/lib/networkx/algorithms/centrality
[2022-03-09T08:26:35.571Z] copying networkx/algorithms/centrality/eigenvector.py -> build/lib/networkx/algorithms/centrality
[2022-03-09T08:26:35.571Z] copying networkx/algorithms/centrality/current_flow_closeness.py -> build/lib/networkx/algorithms/centrality
[2022-03-09T08:26:35.571Z] copying networkx/algorithms/centrality/load.py -> build/lib/networkx/algorithms/centrality
[2022-03-09T08:26:35.571Z] copying networkx/algorithms/centrality/second_order.py -> build/lib/networkx/algorithms/centrality
[2022-03-09T08:26:35.571Z] copying networkx/algorithms/centrality/closeness.py -> build/lib/networkx/algorithms/centrality
[2022-03-09T08:26:35.571Z] copying networkx/algorithms/centrality/flow_matrix.py -> build/lib/networkx/algorithms/centrality
[2022-03-09T08:26:35.571Z] copying networkx/algorithms/centrality/degree_alg.py -> build/lib/networkx/algorithms/centrality
[2022-03-09T08:26:35.571Z] copying networkx/algorithms/centrality/group.py -> build/lib/networkx/algorithms/centrality
[2022-03-09T08:26:35.571Z] copying networkx/algorithms/centrality/betweenness_subset.py -> build/lib/networkx/algorithms/centrality
[2022-03-09T08:26:35.571Z] copying networkx/algorithms/centrality/trophic.py -> build/lib/networkx/algorithms/centrality
[2022-03-09T08:26:35.571Z] copying networkx/algorithms/centrality/voterank_alg.py -> build/lib/networkx/algorithms/centrality
[2022-03-09T08:26:35.571Z] creating build/lib/networkx/algorithms/community
[2022-03-09T08:26:35.571Z] copying networkx/algorithms/community/__init__.py -> build/lib/networkx/algorithms/community
[2022-03-09T08:26:35.571Z] copying networkx/algorithms/community/lukes.py -> build/lib/networkx/algorithms/community
[2022-03-09T08:26:35.571Z] copying networkx/algorithms/community/kernighan_lin.py -> build/lib/networkx/algorithms/community
[2022-03-09T08:26:35.571Z] copying networkx/algorithms/community/modularity_max.py -> build/lib/networkx/algorithms/community
[2022-03-09T08:26:35.571Z] copying networkx/algorithms/community/quality.py -> build/lib/networkx/algorithms/community
[2022-03-09T08:26:35.571Z] copying networkx/algorithms/community/label_propagation.py -> build/lib/networkx/algorithms/community
[2022-03-09T08:26:35.571Z] copying networkx/algorithms/community/community_utils.py -> build/lib/networkx/algorithms/community
[2022-03-09T08:26:35.571Z] copying networkx/algorithms/community/centrality.py -> build/lib/networkx/algorithms/community
[2022-03-09T08:26:35.571Z] copying networkx/algorithms/community/louvain.py -> build/lib/networkx/algorithms/community
[2022-03-09T08:26:35.571Z] copying networkx/algorithms/community/kclique.py -> build/lib/networkx/algorithms/community
[2022-03-09T08:26:35.571Z] copying networkx/algorithms/community/asyn_fluid.py -> build/lib/networkx/algorithms/community
[2022-03-09T08:26:35.571Z] creating build/lib/networkx/algorithms/components
[2022-03-09T08:26:35.571Z] copying networkx/algorithms/components/__init__.py -> build/lib/networkx/algorithms/components
[2022-03-09T08:26:35.571Z] copying networkx/algorithms/components/attracting.py -> build/lib/networkx/algorithms/components
[2022-03-09T08:26:35.571Z] copying networkx/algorithms/components/semiconnected.py -> build/lib/networkx/algorithms/components
[2022-03-09T08:26:35.571Z] copying networkx/algorithms/components/weakly_connected.py -> build/lib/networkx/algorithms/components
[2022-03-09T08:26:35.571Z] copying networkx/algorithms/components/connected.py -> build/lib/networkx/algorithms/components
[2022-03-09T08:26:35.571Z] copying networkx/algorithms/components/strongly_connected.py -> build/lib/networkx/algorithms/components
[2022-03-09T08:26:35.571Z] copying networkx/algorithms/components/biconnected.py -> build/lib/networkx/algorithms/components
[2022-03-09T08:26:35.571Z] creating build/lib/networkx/algorithms/connectivity
[2022-03-09T08:26:35.571Z] copying networkx/algorithms/connectivity/edge_augmentation.py -> build/lib/networkx/algorithms/connectivity
[2022-03-09T08:26:35.571Z] copying networkx/algorithms/connectivity/__init__.py -> build/lib/networkx/algorithms/connectivity
[2022-03-09T08:26:35.572Z] copying networkx/algorithms/connectivity/disjoint_paths.py -> build/lib/networkx/algorithms/connectivity
[2022-03-09T08:26:35.572Z] copying networkx/algorithms/connectivity/stoerwagner.py -> build/lib/networkx/algorithms/connectivity
[2022-03-09T08:26:35.572Z] copying networkx/algorithms/connectivity/kcomponents.py -> build/lib/networkx/algorithms/connectivity
[2022-03-09T08:26:35.572Z] copying networkx/algorithms/connectivity/kcutsets.py -> build/lib/networkx/algorithms/connectivity
[2022-03-09T08:26:35.572Z] copying networkx/algorithms/connectivity/connectivity.py -> build/lib/networkx/algorithms/connectivity
[2022-03-09T08:26:35.572Z] copying networkx/algorithms/connectivity/edge_kcomponents.py -> build/lib/networkx/algorithms/connectivity
[2022-03-09T08:26:35.572Z] copying networkx/algorithms/connectivity/utils.py -> build/lib/networkx/algorithms/connectivity
[2022-03-09T08:26:35.572Z] copying networkx/algorithms/connectivity/cuts.py -> build/lib/networkx/algorithms/connectivity
[2022-03-09T08:26:35.572Z] creating build/lib/networkx/algorithms/coloring
[2022-03-09T08:26:35.572Z] copying networkx/algorithms/coloring/__init__.py -> build/lib/networkx/algorithms/coloring
[2022-03-09T08:26:35.572Z] copying networkx/algorithms/coloring/greedy_coloring.py -> build/lib/networkx/algorithms/coloring
[2022-03-09T08:26:35.572Z] copying networkx/algorithms/coloring/equitable_coloring.py -> build/lib/networkx/algorithms/coloring
[2022-03-09T08:26:35.572Z] creating build/lib/networkx/algorithms/flow
[2022-03-09T08:26:35.572Z] copying networkx/algorithms/flow/networksimplex.py -> build/lib/networkx/algorithms/flow
[2022-03-09T08:26:35.572Z] copying networkx/algorithms/flow/preflowpush.py -> build/lib/networkx/algorithms/flow
[2022-03-09T08:26:35.572Z] copying networkx/algorithms/flow/__init__.py -> build/lib/networkx/algorithms/flow
[2022-03-09T08:26:35.572Z] copying networkx/algorithms/flow/mincost.py -> build/lib/networkx/algorithms/flow
[2022-03-09T08:26:35.572Z] copying networkx/algorithms/flow/shortestaugmentingpath.py -> build/lib/networkx/algorithms/flow
[2022-03-09T08:26:35.572Z] copying networkx/algorithms/flow/boykovkolmogorov.py -> build/lib/networkx/algorithms/flow
[2022-03-09T08:26:35.572Z] copying networkx/algorithms/flow/dinitz_alg.py -> build/lib/networkx/algorithms/flow
[2022-03-09T08:26:35.572Z] copying networkx/algorithms/flow/edmondskarp.py -> build/lib/networkx/algorithms/flow
[2022-03-09T08:26:35.572Z] copying networkx/algorithms/flow/gomory_hu.py -> build/lib/networkx/algorithms/flow
[2022-03-09T08:26:35.572Z] copying networkx/algorithms/flow/capacityscaling.py -> build/lib/networkx/algorithms/flow
[2022-03-09T08:26:35.572Z] copying networkx/algorithms/flow/utils.py -> build/lib/networkx/algorithms/flow
[2022-03-09T08:26:35.572Z] copying networkx/algorithms/flow/maxflow.py -> build/lib/networkx/algorithms/flow
[2022-03-09T08:26:35.572Z] creating build/lib/networkx/algorithms/minors
[2022-03-09T08:26:35.572Z] copying networkx/algorithms/minors/__init__.py -> build/lib/networkx/algorithms/minors
[2022-03-09T08:26:35.572Z] copying networkx/algorithms/minors/contraction.py -> build/lib/networkx/algorithms/minors
[2022-03-09T08:26:35.572Z] creating build/lib/networkx/algorithms/traversal
[2022-03-09T08:26:35.572Z] copying networkx/algorithms/traversal/__init__.py -> build/lib/networkx/algorithms/traversal
[2022-03-09T08:26:35.572Z] copying networkx/algorithms/traversal/depth_first_search.py -> build/lib/networkx/algorithms/traversal
[2022-03-09T08:26:35.572Z] copying networkx/algorithms/traversal/beamsearch.py -> build/lib/networkx/algorithms/traversal
[2022-03-09T08:26:35.572Z] copying networkx/algorithms/traversal/edgebfs.py -> build/lib/networkx/algorithms/traversal
[2022-03-09T08:26:35.572Z] copying networkx/algorithms/traversal/breadth_first_search.py -> build/lib/networkx/algorithms/traversal
[2022-03-09T08:26:35.572Z] copying networkx/algorithms/traversal/edgedfs.py -> build/lib/networkx/algorithms/traversal
[2022-03-09T08:26:35.572Z] creating build/lib/networkx/algorithms/isomorphism
[2022-03-09T08:26:35.572Z] copying networkx/algorithms/isomorphism/__init__.py -> build/lib/networkx/algorithms/isomorphism
[2022-03-09T08:26:35.572Z] copying networkx/algorithms/isomorphism/tree_isomorphism.py -> build/lib/networkx/algorithms/isomorphism
[2022-03-09T08:26:35.572Z] copying networkx/algorithms/isomorphism/isomorph.py -> build/lib/networkx/algorithms/isomorphism
[2022-03-09T08:26:35.572Z] copying networkx/algorithms/isomorphism/temporalisomorphvf2.py -> build/lib/networkx/algorithms/isomorphism
[2022-03-09T08:26:35.572Z] copying networkx/algorithms/isomorphism/isomorphvf2.py -> build/lib/networkx/algorithms/isomorphism
[2022-03-09T08:26:35.572Z] copying networkx/algorithms/isomorphism/vf2userfunc.py -> build/lib/networkx/algorithms/isomorphism
[2022-03-09T08:26:35.572Z] copying networkx/algorithms/isomorphism/matchhelpers.py -> build/lib/networkx/algorithms/isomorphism
[2022-03-09T08:26:35.572Z] copying networkx/algorithms/isomorphism/ismags.py -> build/lib/networkx/algorithms/isomorphism
[2022-03-09T08:26:35.572Z] creating build/lib/networkx/algorithms/shortest_paths
[2022-03-09T08:26:35.572Z] copying networkx/algorithms/shortest_paths/__init__.py -> build/lib/networkx/algorithms/shortest_paths
[2022-03-09T08:26:35.572Z] copying networkx/algorithms/shortest_paths/astar.py -> build/lib/networkx/algorithms/shortest_paths
[2022-03-09T08:26:35.572Z] copying networkx/algorithms/shortest_paths/dense.py -> build/lib/networkx/algorithms/shortest_paths
[2022-03-09T08:26:35.572Z] copying networkx/algorithms/shortest_paths/unweighted.py -> build/lib/networkx/algorithms/shortest_paths
[2022-03-09T08:26:35.573Z] copying networkx/algorithms/shortest_paths/generic.py -> build/lib/networkx/algorithms/shortest_paths
[2022-03-09T08:26:35.573Z] copying networkx/algorithms/shortest_paths/weighted.py -> build/lib/networkx/algorithms/shortest_paths
[2022-03-09T08:26:35.573Z] creating build/lib/networkx/algorithms/link_analysis
[2022-03-09T08:26:35.573Z] copying networkx/algorithms/link_analysis/__init__.py -> build/lib/networkx/algorithms/link_analysis
[2022-03-09T08:26:35.573Z] copying networkx/algorithms/link_analysis/pagerank_alg.py -> build/lib/networkx/algorithms/link_analysis
[2022-03-09T08:26:35.573Z] copying networkx/algorithms/link_analysis/hits_alg.py -> build/lib/networkx/algorithms/link_analysis
[2022-03-09T08:26:35.573Z] creating build/lib/networkx/algorithms/operators
[2022-03-09T08:26:35.573Z] copying networkx/algorithms/operators/__init__.py -> build/lib/networkx/algorithms/operators
[2022-03-09T08:26:35.573Z] copying networkx/algorithms/operators/binary.py -> build/lib/networkx/algorithms/operators
[2022-03-09T08:26:35.573Z] copying networkx/algorithms/operators/product.py -> build/lib/networkx/algorithms/operators
[2022-03-09T08:26:35.573Z] copying networkx/algorithms/operators/unary.py -> build/lib/networkx/algorithms/operators
[2022-03-09T08:26:35.573Z] copying networkx/algorithms/operators/all.py -> build/lib/networkx/algorithms/operators
[2022-03-09T08:26:35.573Z] creating build/lib/networkx/algorithms/approximation
[2022-03-09T08:26:35.573Z] copying networkx/algorithms/approximation/__init__.py -> build/lib/networkx/algorithms/approximation
[2022-03-09T08:26:35.573Z] copying networkx/algorithms/approximation/maxcut.py -> build/lib/networkx/algorithms/approximation
[2022-03-09T08:26:35.573Z] copying networkx/algorithms/approximation/ramsey.py -> build/lib/networkx/algorithms/approximation
[2022-03-09T08:26:35.573Z] copying networkx/algorithms/approximation/clique.py -> build/lib/networkx/algorithms/approximation
[2022-03-09T08:26:35.573Z] copying networkx/algorithms/approximation/kcomponents.py -> build/lib/networkx/algorithms/approximation
[2022-03-09T08:26:35.573Z] copying networkx/algorithms/approximation/connectivity.py -> build/lib/networkx/algorithms/approximation
[2022-03-09T08:26:35.573Z] copying networkx/algorithms/approximation/treewidth.py -> build/lib/networkx/algorithms/approximation
[2022-03-09T08:26:35.573Z] copying networkx/algorithms/approximation/dominating_set.py -> build/lib/networkx/algorithms/approximation
[2022-03-09T08:26:35.573Z] copying networkx/algorithms/approximation/vertex_cover.py -> build/lib/networkx/algorithms/approximation
[2022-03-09T08:26:35.573Z] copying networkx/algorithms/approximation/traveling_salesman.py -> build/lib/networkx/algorithms/approximation
[2022-03-09T08:26:35.573Z] copying networkx/algorithms/approximation/distance_measures.py -> build/lib/networkx/algorithms/approximation
[2022-03-09T08:26:35.573Z] copying networkx/algorithms/approximation/matching.py -> build/lib/networkx/algorithms/approximation
[2022-03-09T08:26:35.573Z] copying networkx/algorithms/approximation/clustering_coefficient.py -> build/lib/networkx/algorithms/approximation
[2022-03-09T08:26:35.573Z] copying networkx/algorithms/approximation/steinertree.py -> build/lib/networkx/algorithms/approximation
[2022-03-09T08:26:35.573Z] creating build/lib/networkx/algorithms/tree
[2022-03-09T08:26:35.573Z] copying networkx/algorithms/tree/operations.py -> build/lib/networkx/algorithms/tree
[2022-03-09T08:26:35.573Z] copying networkx/algorithms/tree/__init__.py -> build/lib/networkx/algorithms/tree
[2022-03-09T08:26:35.573Z] copying networkx/algorithms/tree/recognition.py -> build/lib/networkx/algorithms/tree
[2022-03-09T08:26:35.573Z] copying networkx/algorithms/tree/coding.py -> build/lib/networkx/algorithms/tree
[2022-03-09T08:26:35.573Z] copying networkx/algorithms/tree/branchings.py -> build/lib/networkx/algorithms/tree
[2022-03-09T08:26:35.573Z] copying networkx/algorithms/tree/mst.py -> build/lib/networkx/algorithms/tree
[2022-03-09T08:26:35.573Z] copying networkx/algorithms/tree/decomposition.py -> build/lib/networkx/algorithms/tree
[2022-03-09T08:26:35.573Z] creating build/lib/networkx/classes
[2022-03-09T08:26:35.573Z] copying networkx/classes/reportviews.py -> build/lib/networkx/classes
[2022-03-09T08:26:35.573Z] copying networkx/classes/__init__.py -> build/lib/networkx/classes
[2022-03-09T08:26:35.573Z] copying networkx/classes/multigraph.py -> build/lib/networkx/classes
[2022-03-09T08:26:35.573Z] copying networkx/classes/function.py -> build/lib/networkx/classes
[2022-03-09T08:26:35.573Z] copying networkx/classes/graphviews.py -> build/lib/networkx/classes
[2022-03-09T08:26:35.573Z] copying networkx/classes/filters.py -> build/lib/networkx/classes
[2022-03-09T08:26:35.573Z] copying networkx/classes/ordered.py -> build/lib/networkx/classes
[2022-03-09T08:26:35.573Z] copying networkx/classes/multidigraph.py -> build/lib/networkx/classes
[2022-03-09T08:26:35.573Z] copying networkx/classes/graph.py -> build/lib/networkx/classes
[2022-03-09T08:26:35.573Z] copying networkx/classes/digraph.py -> build/lib/networkx/classes
[2022-03-09T08:26:35.573Z] copying networkx/classes/coreviews.py -> build/lib/networkx/classes
[2022-03-09T08:26:35.573Z] creating build/lib/networkx/generators
[2022-03-09T08:26:35.573Z] copying networkx/generators/expanders.py -> build/lib/networkx/generators
[2022-03-09T08:26:35.573Z] copying networkx/generators/__init__.py -> build/lib/networkx/generators
[2022-03-09T08:26:35.573Z] copying networkx/generators/spectral_graph_forge.py -> build/lib/networkx/generators
[2022-03-09T08:26:35.573Z] copying networkx/generators/lattice.py -> build/lib/networkx/generators
[2022-03-09T08:26:35.573Z] copying networkx/generators/atlas.py -> build/lib/networkx/generators
[2022-03-09T08:26:35.573Z] copying networkx/generators/interval_graph.py -> build/lib/networkx/generators
[2022-03-09T08:26:35.574Z] copying networkx/generators/internet_as_graphs.py -> build/lib/networkx/generators
[2022-03-09T08:26:35.574Z] copying networkx/generators/nonisomorphic_trees.py -> build/lib/networkx/generators
[2022-03-09T08:26:35.574Z] copying networkx/generators/line.py -> build/lib/networkx/generators
[2022-03-09T08:26:35.574Z] copying networkx/generators/classic.py -> build/lib/networkx/generators
[2022-03-09T08:26:35.574Z] copying networkx/generators/stochastic.py -> build/lib/networkx/generators
[2022-03-09T08:26:35.574Z] copying networkx/generators/joint_degree_seq.py -> build/lib/networkx/generators
[2022-03-09T08:26:35.574Z] copying networkx/generators/random_clustered.py -> build/lib/networkx/generators
[2022-03-09T08:26:35.574Z] copying networkx/generators/ego.py -> build/lib/networkx/generators
[2022-03-09T08:26:35.574Z] copying networkx/generators/community.py -> build/lib/networkx/generators
[2022-03-09T08:26:35.574Z] copying networkx/generators/duplication.py -> build/lib/networkx/generators
[2022-03-09T08:26:35.574Z] copying networkx/generators/geometric.py -> build/lib/networkx/generators
[2022-03-09T08:26:35.574Z] copying networkx/generators/degree_seq.py -> build/lib/networkx/generators
[2022-03-09T08:26:35.574Z] copying networkx/generators/sudoku.py -> build/lib/networkx/generators
[2022-03-09T08:26:35.574Z] copying networkx/generators/intersection.py -> build/lib/networkx/generators
[2022-03-09T08:26:35.574Z] copying networkx/generators/directed.py -> build/lib/networkx/generators
[2022-03-09T08:26:35.574Z] copying networkx/generators/triads.py -> build/lib/networkx/generators
[2022-03-09T08:26:35.574Z] copying networkx/generators/mycielski.py -> build/lib/networkx/generators
[2022-03-09T08:26:35.574Z] copying networkx/generators/random_graphs.py -> build/lib/networkx/generators
[2022-03-09T08:26:35.574Z] copying networkx/generators/harary_graph.py -> build/lib/networkx/generators
[2022-03-09T08:26:35.574Z] copying networkx/generators/social.py -> build/lib/networkx/generators
[2022-03-09T08:26:35.574Z] copying networkx/generators/cographs.py -> build/lib/networkx/generators
[2022-03-09T08:26:35.574Z] copying networkx/generators/trees.py -> build/lib/networkx/generators
[2022-03-09T08:26:35.574Z] copying networkx/generators/small.py -> build/lib/networkx/generators
[2022-03-09T08:26:35.574Z] creating build/lib/networkx/drawing
[2022-03-09T08:26:35.574Z] copying networkx/drawing/__init__.py -> build/lib/networkx/drawing
[2022-03-09T08:26:35.574Z] copying networkx/drawing/nx_pydot.py -> build/lib/networkx/drawing
[2022-03-09T08:26:35.574Z] copying networkx/drawing/layout.py -> build/lib/networkx/drawing
[2022-03-09T08:26:35.574Z] copying networkx/drawing/nx_agraph.py -> build/lib/networkx/drawing
[2022-03-09T08:26:35.574Z] copying networkx/drawing/nx_pylab.py -> build/lib/networkx/drawing
[2022-03-09T08:26:35.574Z] creating build/lib/networkx/linalg
[2022-03-09T08:26:35.574Z] copying networkx/linalg/graphmatrix.py -> build/lib/networkx/linalg
[2022-03-09T08:26:35.574Z] copying networkx/linalg/__init__.py -> build/lib/networkx/linalg
[2022-03-09T08:26:35.574Z] copying networkx/linalg/laplacianmatrix.py -> build/lib/networkx/linalg
[2022-03-09T08:26:35.574Z] copying networkx/linalg/bethehessianmatrix.py -> build/lib/networkx/linalg
[2022-03-09T08:26:35.574Z] copying networkx/linalg/algebraicconnectivity.py -> build/lib/networkx/linalg
[2022-03-09T08:26:35.574Z] copying networkx/linalg/modularitymatrix.py -> build/lib/networkx/linalg
[2022-03-09T08:26:35.574Z] copying networkx/linalg/attrmatrix.py -> build/lib/networkx/linalg
[2022-03-09T08:26:35.574Z] copying networkx/linalg/spectrum.py -> build/lib/networkx/linalg
[2022-03-09T08:26:35.574Z] creating build/lib/networkx/readwrite
[2022-03-09T08:26:35.574Z] copying networkx/readwrite/__init__.py -> build/lib/networkx/readwrite
[2022-03-09T08:26:35.574Z] copying networkx/readwrite/gpickle.py -> build/lib/networkx/readwrite
[2022-03-09T08:26:35.574Z] copying networkx/readwrite/gexf.py -> build/lib/networkx/readwrite
[2022-03-09T08:26:35.574Z] copying networkx/readwrite/graphml.py -> build/lib/networkx/readwrite
[2022-03-09T08:26:35.574Z] copying networkx/readwrite/adjlist.py -> build/lib/networkx/readwrite
[2022-03-09T08:26:35.574Z] copying networkx/readwrite/text.py -> build/lib/networkx/readwrite
[2022-03-09T08:26:35.574Z] copying networkx/readwrite/gml.py -> build/lib/networkx/readwrite
[2022-03-09T08:26:35.574Z] copying networkx/readwrite/nx_shp.py -> build/lib/networkx/readwrite
[2022-03-09T08:26:35.574Z] copying networkx/readwrite/p2g.py -> build/lib/networkx/readwrite
[2022-03-09T08:26:35.574Z] copying networkx/readwrite/graph6.py -> build/lib/networkx/readwrite
[2022-03-09T08:26:35.574Z] copying networkx/readwrite/leda.py -> build/lib/networkx/readwrite
[2022-03-09T08:26:35.574Z] copying networkx/readwrite/pajek.py -> build/lib/networkx/readwrite
[2022-03-09T08:26:35.574Z] copying networkx/readwrite/sparse6.py -> build/lib/networkx/readwrite
[2022-03-09T08:26:35.574Z] copying networkx/readwrite/edgelist.py -> build/lib/networkx/readwrite
[2022-03-09T08:26:35.574Z] copying networkx/readwrite/multiline_adjlist.py -> build/lib/networkx/readwrite
[2022-03-09T08:26:35.574Z] copying networkx/readwrite/nx_yaml.py -> build/lib/networkx/readwrite
[2022-03-09T08:26:35.574Z] creating build/lib/networkx/readwrite/json_graph
[2022-03-09T08:26:35.574Z] copying networkx/readwrite/json_graph/__init__.py -> build/lib/networkx/readwrite/json_graph
[2022-03-09T08:26:35.574Z] copying networkx/readwrite/json_graph/tree.py -> build/lib/networkx/readwrite/json_graph
[2022-03-09T08:26:35.574Z] copying networkx/readwrite/json_graph/jit.py -> build/lib/networkx/readwrite/json_graph
[2022-03-09T08:26:35.574Z] copying networkx/readwrite/json_graph/adjacency.py -> build/lib/networkx/readwrite/json_graph
[2022-03-09T08:26:35.574Z] copying networkx/readwrite/json_graph/node_link.py -> build/lib/networkx/readwrite/json_graph
[2022-03-09T08:26:35.575Z] copying networkx/readwrite/json_graph/cytoscape.py -> build/lib/networkx/readwrite/json_graph
[2022-03-09T08:26:35.575Z] creating build/lib/networkx/tests
[2022-03-09T08:26:35.575Z] copying networkx/tests/__init__.py -> build/lib/networkx/tests
[2022-03-09T08:26:35.575Z] copying networkx/tests/test_lazy_imports.py -> build/lib/networkx/tests
[2022-03-09T08:26:35.575Z] copying networkx/tests/test_relabel.py -> build/lib/networkx/tests
[2022-03-09T08:26:35.575Z] copying networkx/tests/test_import.py -> build/lib/networkx/tests
[2022-03-09T08:26:35.575Z] copying networkx/tests/test_exceptions.py -> build/lib/networkx/tests
[2022-03-09T08:26:35.575Z] copying networkx/tests/test_all_random_functions.py -> build/lib/networkx/tests
[2022-03-09T08:26:35.575Z] copying networkx/tests/test_convert_scipy.py -> build/lib/networkx/tests
[2022-03-09T08:26:35.575Z] copying networkx/tests/test_convert.py -> build/lib/networkx/tests
[2022-03-09T08:26:35.575Z] copying networkx/tests/test_convert_pandas.py -> build/lib/networkx/tests
[2022-03-09T08:26:35.575Z] copying networkx/tests/test_convert_numpy.py -> build/lib/networkx/tests
[2022-03-09T08:26:35.575Z] creating build/lib/networkx/testing
[2022-03-09T08:26:35.575Z] copying networkx/testing/__init__.py -> build/lib/networkx/testing
[2022-03-09T08:26:35.575Z] copying networkx/testing/test.py -> build/lib/networkx/testing
[2022-03-09T08:26:35.575Z] copying networkx/testing/utils.py -> build/lib/networkx/testing
[2022-03-09T08:26:35.575Z] creating build/lib/networkx/utils
[2022-03-09T08:26:35.575Z] copying networkx/utils/__init__.py -> build/lib/networkx/utils
[2022-03-09T08:26:35.575Z] copying networkx/utils/rcm.py -> build/lib/networkx/utils
[2022-03-09T08:26:35.575Z] copying networkx/utils/heaps.py -> build/lib/networkx/utils
[2022-03-09T08:26:35.575Z] copying networkx/utils/random_sequence.py -> build/lib/networkx/utils
[2022-03-09T08:26:35.575Z] copying networkx/utils/decorators.py -> build/lib/networkx/utils
[2022-03-09T08:26:35.575Z] copying networkx/utils/union_find.py -> build/lib/networkx/utils
[2022-03-09T08:26:35.575Z] copying networkx/utils/misc.py -> build/lib/networkx/utils
[2022-03-09T08:26:35.575Z] copying networkx/utils/contextmanagers.py -> build/lib/networkx/utils
[2022-03-09T08:26:35.575Z] copying networkx/utils/mapped_queue.py -> build/lib/networkx/utils
[2022-03-09T08:26:35.575Z] creating build/lib/networkx/algorithms/tests
[2022-03-09T08:26:35.575Z] copying networkx/algorithms/tests/test_cuts.py -> build/lib/networkx/algorithms/tests
[2022-03-09T08:26:35.575Z] copying networkx/algorithms/tests/test_clique.py -> build/lib/networkx/algorithms/tests
[2022-03-09T08:26:35.575Z] copying networkx/algorithms/tests/__init__.py -> build/lib/networkx/algorithms/tests
[2022-03-09T08:26:35.575Z] copying networkx/algorithms/tests/test_sparsifiers.py -> build/lib/networkx/algorithms/tests
[2022-03-09T08:26:35.575Z] copying networkx/algorithms/tests/test_planarity.py -> build/lib/networkx/algorithms/tests
[2022-03-09T08:26:35.575Z] copying networkx/algorithms/tests/test_voronoi.py -> build/lib/networkx/algorithms/tests
[2022-03-09T08:26:35.575Z] copying networkx/algorithms/tests/test_asteroidal.py -> build/lib/networkx/algorithms/tests
[2022-03-09T08:26:35.575Z] copying networkx/algorithms/tests/test_graph_hashing.py -> build/lib/networkx/algorithms/tests
[2022-03-09T08:26:35.575Z] copying networkx/algorithms/tests/test_summarization.py -> build/lib/networkx/algorithms/tests
[2022-03-09T08:26:35.575Z] copying networkx/algorithms/tests/test_dag.py -> build/lib/networkx/algorithms/tests
[2022-03-09T08:26:35.575Z] copying networkx/algorithms/tests/test_regular.py -> build/lib/networkx/algorithms/tests
[2022-03-09T08:26:35.575Z] copying networkx/algorithms/tests/test_boundary.py -> build/lib/networkx/algorithms/tests
[2022-03-09T08:26:35.575Z] copying networkx/algorithms/tests/test_similarity.py -> build/lib/networkx/algorithms/tests
[2022-03-09T08:26:35.575Z] copying networkx/algorithms/tests/test_lowest_common_ancestors.py -> build/lib/networkx/algorithms/tests
[2022-03-09T08:26:35.575Z] copying networkx/algorithms/tests/test_swap.py -> build/lib/networkx/algorithms/tests
[2022-03-09T08:26:35.575Z] copying networkx/algorithms/tests/test_link_prediction.py -> build/lib/networkx/algorithms/tests
[2022-03-09T08:26:35.575Z] copying networkx/algorithms/tests/test_max_weight_clique.py -> build/lib/networkx/algorithms/tests
[2022-03-09T08:26:35.575Z] copying networkx/algorithms/tests/test_core.py -> build/lib/networkx/algorithms/tests
[2022-03-09T08:26:35.575Z] copying networkx/algorithms/tests/test_mis.py -> build/lib/networkx/algorithms/tests
[2022-03-09T08:26:35.575Z] copying networkx/algorithms/tests/test_threshold.py -> build/lib/networkx/algorithms/tests
[2022-03-09T08:26:35.575Z] copying networkx/algorithms/tests/test_covering.py -> build/lib/networkx/algorithms/tests
[2022-03-09T08:26:35.575Z] copying networkx/algorithms/tests/test_chains.py -> build/lib/networkx/algorithms/tests
[2022-03-09T08:26:35.575Z] copying networkx/algorithms/tests/test_distance_regular.py -> build/lib/networkx/algorithms/tests
[2022-03-09T08:26:35.575Z] copying networkx/algorithms/tests/test_graphical.py -> build/lib/networkx/algorithms/tests
[2022-03-09T08:26:35.575Z] copying networkx/algorithms/tests/test_isolate.py -> build/lib/networkx/algorithms/tests
[2022-03-09T08:26:35.575Z] copying networkx/algorithms/tests/test_communicability.py -> build/lib/networkx/algorithms/tests
[2022-03-09T08:26:35.575Z] copying networkx/algorithms/tests/test_d_separation.py -> build/lib/networkx/algorithms/tests
[2022-03-09T08:26:35.575Z] copying networkx/algorithms/tests/test_euler.py -> build/lib/networkx/algorithms/tests
[2022-03-09T08:26:35.576Z] copying networkx/algorithms/tests/test_structuralholes.py -> build/lib/networkx/algorithms/tests
[2022-03-09T08:26:35.576Z] copying networkx/algorithms/tests/test_cluster.py -> build/lib/networkx/algorithms/tests
[2022-03-09T08:26:35.576Z] copying networkx/algorithms/tests/test_distance_measures.py -> build/lib/networkx/algorithms/tests
[2022-03-09T08:26:35.576Z] copying networkx/algorithms/tests/test_dominating.py -> build/lib/networkx/algorithms/tests
[2022-03-09T08:26:35.576Z] copying networkx/algorithms/tests/test_smetric.py -> build/lib/networkx/algorithms/tests
[2022-03-09T08:26:35.576Z] copying networkx/algorithms/tests/test_richclub.py -> build/lib/networkx/algorithms/tests
[2022-03-09T08:26:35.576Z] copying networkx/algorithms/tests/test_hybrid.py -> build/lib/networkx/algorithms/tests
[2022-03-09T08:26:35.576Z] copying networkx/algorithms/tests/test_hierarchy.py -> build/lib/networkx/algorithms/tests
[2022-03-09T08:26:35.576Z] copying networkx/algorithms/tests/test_non_randomness.py -> build/lib/networkx/algorithms/tests
[2022-03-09T08:26:35.576Z] copying networkx/algorithms/tests/test_moral.py -> build/lib/networkx/algorithms/tests
[2022-03-09T08:26:35.576Z] copying networkx/algorithms/tests/test_efficiency.py -> build/lib/networkx/algorithms/tests
[2022-03-09T08:26:35.576Z] copying networkx/algorithms/tests/test_simple_paths.py -> build/lib/networkx/algorithms/tests
[2022-03-09T08:26:35.576Z] copying networkx/algorithms/tests/test_tournament.py -> build/lib/networkx/algorithms/tests
[2022-03-09T08:26:35.576Z] copying networkx/algorithms/tests/test_dominance.py -> build/lib/networkx/algorithms/tests
[2022-03-09T08:26:35.576Z] copying networkx/algorithms/tests/test_matching.py -> build/lib/networkx/algorithms/tests
[2022-03-09T08:26:35.576Z] copying networkx/algorithms/tests/test_triads.py -> build/lib/networkx/algorithms/tests
[2022-03-09T08:26:35.576Z] copying networkx/algorithms/tests/test_chordal.py -> build/lib/networkx/algorithms/tests
[2022-03-09T08:26:35.576Z] copying networkx/algorithms/tests/test_cycles.py -> build/lib/networkx/algorithms/tests
[2022-03-09T08:26:35.576Z] copying networkx/algorithms/tests/test_vitality.py -> build/lib/networkx/algorithms/tests
[2022-03-09T08:26:35.576Z] copying networkx/algorithms/tests/test_reciprocity.py -> build/lib/networkx/algorithms/tests
[2022-03-09T08:26:35.576Z] copying networkx/algorithms/tests/test_planar_drawing.py -> build/lib/networkx/algorithms/tests
[2022-03-09T08:26:35.576Z] copying networkx/algorithms/tests/test_bridges.py -> build/lib/networkx/algorithms/tests
[2022-03-09T08:26:35.576Z] copying networkx/algorithms/tests/test_smallworld.py -> build/lib/networkx/algorithms/tests
[2022-03-09T08:26:35.576Z] copying networkx/algorithms/tests/test_node_classification_deprecations.py -> build/lib/networkx/algorithms/tests
[2022-03-09T08:26:35.576Z] copying networkx/algorithms/tests/test_wiener.py -> build/lib/networkx/algorithms/tests
[2022-03-09T08:26:35.576Z] copying networkx/algorithms/tests/test_node_classification.py -> build/lib/networkx/algorithms/tests
[2022-03-09T08:26:35.576Z] creating build/lib/networkx/algorithms/assortativity/tests
[2022-03-09T08:26:35.576Z] copying networkx/algorithms/assortativity/tests/__init__.py -> build/lib/networkx/algorithms/assortativity/tests
[2022-03-09T08:26:35.576Z] copying networkx/algorithms/assortativity/tests/test_neighbor_degree.py -> build/lib/networkx/algorithms/assortativity/tests
[2022-03-09T08:26:35.576Z] copying networkx/algorithms/assortativity/tests/test_connectivity.py -> build/lib/networkx/algorithms/assortativity/tests
[2022-03-09T08:26:35.576Z] copying networkx/algorithms/assortativity/tests/test_pairs.py -> build/lib/networkx/algorithms/assortativity/tests
[2022-03-09T08:26:35.576Z] copying networkx/algorithms/assortativity/tests/base_test.py -> build/lib/networkx/algorithms/assortativity/tests
[2022-03-09T08:26:35.576Z] copying networkx/algorithms/assortativity/tests/test_mixing.py -> build/lib/networkx/algorithms/assortativity/tests
[2022-03-09T08:26:35.576Z] copying networkx/algorithms/assortativity/tests/test_correlation.py -> build/lib/networkx/algorithms/assortativity/tests
[2022-03-09T08:26:35.576Z] creating build/lib/networkx/algorithms/bipartite/tests
[2022-03-09T08:26:35.576Z] copying networkx/algorithms/bipartite/tests/test_centrality.py -> build/lib/networkx/algorithms/bipartite/tests
[2022-03-09T08:26:35.576Z] copying networkx/algorithms/bipartite/tests/__init__.py -> build/lib/networkx/algorithms/bipartite/tests
[2022-03-09T08:26:35.576Z] copying networkx/algorithms/bipartite/tests/test_covering.py -> build/lib/networkx/algorithms/bipartite/tests
[2022-03-09T08:26:35.576Z] copying networkx/algorithms/bipartite/tests/test_edgelist.py -> build/lib/networkx/algorithms/bipartite/tests
[2022-03-09T08:26:35.576Z] copying networkx/algorithms/bipartite/tests/test_basic.py -> build/lib/networkx/algorithms/bipartite/tests
[2022-03-09T08:26:35.576Z] copying networkx/algorithms/bipartite/tests/test_cluster.py -> build/lib/networkx/algorithms/bipartite/tests
[2022-03-09T08:26:35.576Z] copying networkx/algorithms/bipartite/tests/test_project.py -> build/lib/networkx/algorithms/bipartite/tests
[2022-03-09T08:26:35.576Z] copying networkx/algorithms/bipartite/tests/test_spectral_bipartivity.py -> build/lib/networkx/algorithms/bipartite/tests
[2022-03-09T08:26:35.576Z] copying networkx/algorithms/bipartite/tests/test_matrix.py -> build/lib/networkx/algorithms/bipartite/tests
[2022-03-09T08:26:35.576Z] copying networkx/algorithms/bipartite/tests/test_matching.py -> build/lib/networkx/algorithms/bipartite/tests
[2022-03-09T08:26:35.576Z] copying networkx/algorithms/bipartite/tests/test_redundancy.py -> build/lib/networkx/algorithms/bipartite/tests
[2022-03-09T08:26:35.576Z] copying networkx/algorithms/bipartite/tests/test_generators.py -> build/lib/networkx/algorithms/bipartite/tests
[2022-03-09T08:26:35.576Z] creating build/lib/networkx/algorithms/centrality/tests
[2022-03-09T08:26:35.577Z] copying networkx/algorithms/centrality/tests/test_katz_centrality.py -> build/lib/networkx/algorithms/centrality/tests
[2022-03-09T08:26:35.577Z] copying networkx/algorithms/centrality/tests/__init__.py -> build/lib/networkx/algorithms/centrality/tests
[2022-03-09T08:26:35.577Z] copying networkx/algorithms/centrality/tests/test_trophic.py -> build/lib/networkx/algorithms/centrality/tests
[2022-03-09T08:26:35.577Z] copying networkx/algorithms/centrality/tests/test_subgraph.py -> build/lib/networkx/algorithms/centrality/tests
[2022-03-09T08:26:35.577Z] copying networkx/algorithms/centrality/tests/test_current_flow_betweenness_centrality.py -> build/lib/networkx/algorithms/centrality/tests
[2022-03-09T08:26:35.577Z] copying networkx/algorithms/centrality/tests/test_betweenness_centrality_subset.py -> build/lib/networkx/algorithms/centrality/tests
[2022-03-09T08:26:35.577Z] copying networkx/algorithms/centrality/tests/test_group.py -> build/lib/networkx/algorithms/centrality/tests
[2022-03-09T08:26:35.577Z] copying networkx/algorithms/centrality/tests/test_harmonic_centrality.py -> build/lib/networkx/algorithms/centrality/tests
[2022-03-09T08:26:35.577Z] copying networkx/algorithms/centrality/tests/test_second_order_centrality.py -> build/lib/networkx/algorithms/centrality/tests
[2022-03-09T08:26:35.577Z] copying networkx/algorithms/centrality/tests/test_dispersion.py -> build/lib/networkx/algorithms/centrality/tests
[2022-03-09T08:26:35.577Z] copying networkx/algorithms/centrality/tests/test_voterank.py -> build/lib/networkx/algorithms/centrality/tests
[2022-03-09T08:26:35.577Z] copying networkx/algorithms/centrality/tests/test_closeness_centrality.py -> build/lib/networkx/algorithms/centrality/tests
[2022-03-09T08:26:35.577Z] copying networkx/algorithms/centrality/tests/test_reaching.py -> build/lib/networkx/algorithms/centrality/tests
[2022-03-09T08:26:35.577Z] copying networkx/algorithms/centrality/tests/test_eigenvector_centrality.py -> build/lib/networkx/algorithms/centrality/tests
[2022-03-09T08:26:35.577Z] copying networkx/algorithms/centrality/tests/test_degree_centrality.py -> build/lib/networkx/algorithms/centrality/tests
[2022-03-09T08:26:35.577Z] copying networkx/algorithms/centrality/tests/test_current_flow_betweenness_centrality_subset.py -> build/lib/networkx/algorithms/centrality/tests
[2022-03-09T08:26:35.577Z] copying networkx/algorithms/centrality/tests/test_current_flow_closeness.py -> build/lib/networkx/algorithms/centrality/tests
[2022-03-09T08:26:35.577Z] copying networkx/algorithms/centrality/tests/test_load_centrality.py -> build/lib/networkx/algorithms/centrality/tests
[2022-03-09T08:26:35.577Z] copying networkx/algorithms/centrality/tests/test_betweenness_centrality.py -> build/lib/networkx/algorithms/centrality/tests
[2022-03-09T08:26:35.577Z] copying networkx/algorithms/centrality/tests/test_percolation_centrality.py -> build/lib/networkx/algorithms/centrality/tests
[2022-03-09T08:26:35.577Z] creating build/lib/networkx/algorithms/community/tests
[2022-03-09T08:26:35.577Z] copying networkx/algorithms/community/tests/test_centrality.py -> build/lib/networkx/algorithms/community/tests
[2022-03-09T08:26:35.577Z] copying networkx/algorithms/community/tests/__init__.py -> build/lib/networkx/algorithms/community/tests
[2022-03-09T08:26:35.577Z] copying networkx/algorithms/community/tests/test_quality.py -> build/lib/networkx/algorithms/community/tests
[2022-03-09T08:26:35.577Z] copying networkx/algorithms/community/tests/test_utils.py -> build/lib/networkx/algorithms/community/tests
[2022-03-09T08:26:35.577Z] copying networkx/algorithms/community/tests/test_asyn_fluid.py -> build/lib/networkx/algorithms/community/tests
[2022-03-09T08:26:35.577Z] copying networkx/algorithms/community/tests/test_lukes.py -> build/lib/networkx/algorithms/community/tests
[2022-03-09T08:26:35.577Z] copying networkx/algorithms/community/tests/test_modularity_max.py -> build/lib/networkx/algorithms/community/tests
[2022-03-09T08:26:35.577Z] copying networkx/algorithms/community/tests/test_label_propagation.py -> build/lib/networkx/algorithms/community/tests
[2022-03-09T08:26:35.577Z] copying networkx/algorithms/community/tests/test_kernighan_lin.py -> build/lib/networkx/algorithms/community/tests
[2022-03-09T08:26:35.577Z] copying networkx/algorithms/community/tests/test_louvain.py -> build/lib/networkx/algorithms/community/tests
[2022-03-09T08:26:35.577Z] copying networkx/algorithms/community/tests/test_kclique.py -> build/lib/networkx/algorithms/community/tests
[2022-03-09T08:26:35.577Z] creating build/lib/networkx/algorithms/components/tests
[2022-03-09T08:26:35.577Z] copying networkx/algorithms/components/tests/__init__.py -> build/lib/networkx/algorithms/components/tests
[2022-03-09T08:26:35.577Z] copying networkx/algorithms/components/tests/test_strongly_connected.py -> build/lib/networkx/algorithms/components/tests
[2022-03-09T08:26:35.577Z] copying networkx/algorithms/components/tests/test_semiconnected.py -> build/lib/networkx/algorithms/components/tests
[2022-03-09T08:26:35.577Z] copying networkx/algorithms/components/tests/test_biconnected.py -> build/lib/networkx/algorithms/components/tests
[2022-03-09T08:26:35.577Z] copying networkx/algorithms/components/tests/test_weakly_connected.py -> build/lib/networkx/algorithms/components/tests
[2022-03-09T08:26:35.577Z] copying networkx/algorithms/components/tests/test_attracting.py -> build/lib/networkx/algorithms/components/tests
[2022-03-09T08:26:35.577Z] copying networkx/algorithms/components/tests/test_connected.py -> build/lib/networkx/algorithms/components/tests
[2022-03-09T08:26:35.577Z] creating build/lib/networkx/algorithms/connectivity/tests
[2022-03-09T08:26:35.577Z] copying networkx/algorithms/connectivity/tests/test_cuts.py -> build/lib/networkx/algorithms/connectivity/tests
[2022-03-09T08:26:35.577Z] copying networkx/algorithms/connectivity/tests/test_edge_augmentation.py -> build/lib/networkx/algorithms/connectivity/tests
[2022-03-09T08:26:35.578Z] copying networkx/algorithms/connectivity/tests/test_edge_kcomponents.py -> build/lib/networkx/algorithms/connectivity/tests
[2022-03-09T08:26:35.578Z] copying networkx/algorithms/connectivity/tests/__init__.py -> build/lib/networkx/algorithms/connectivity/tests
[2022-03-09T08:26:35.578Z] copying networkx/algorithms/connectivity/tests/test_connectivity.py -> build/lib/networkx/algorithms/connectivity/tests
[2022-03-09T08:26:35.578Z] copying networkx/algorithms/connectivity/tests/test_disjoint_paths.py -> build/lib/networkx/algorithms/connectivity/tests
[2022-03-09T08:26:35.578Z] copying networkx/algorithms/connectivity/tests/test_kcomponents.py -> build/lib/networkx/algorithms/connectivity/tests
[2022-03-09T08:26:35.578Z] copying networkx/algorithms/connectivity/tests/test_stoer_wagner.py -> build/lib/networkx/algorithms/connectivity/tests
[2022-03-09T08:26:35.578Z] copying networkx/algorithms/connectivity/tests/test_kcutsets.py -> build/lib/networkx/algorithms/connectivity/tests
[2022-03-09T08:26:35.578Z] creating build/lib/networkx/algorithms/coloring/tests
[2022-03-09T08:26:35.578Z] copying networkx/algorithms/coloring/tests/__init__.py -> build/lib/networkx/algorithms/coloring/tests
[2022-03-09T08:26:35.578Z] copying networkx/algorithms/coloring/tests/test_coloring.py -> build/lib/networkx/algorithms/coloring/tests
[2022-03-09T08:26:35.578Z] creating build/lib/networkx/algorithms/flow/tests
[2022-03-09T08:26:35.578Z] copying networkx/algorithms/flow/tests/__init__.py -> build/lib/networkx/algorithms/flow/tests
[2022-03-09T08:26:35.578Z] copying networkx/algorithms/flow/tests/test_networksimplex.py -> build/lib/networkx/algorithms/flow/tests
[2022-03-09T08:26:35.578Z] copying networkx/algorithms/flow/tests/test_mincost.py -> build/lib/networkx/algorithms/flow/tests
[2022-03-09T08:26:35.578Z] copying networkx/algorithms/flow/tests/test_gomory_hu.py -> build/lib/networkx/algorithms/flow/tests
[2022-03-09T08:26:35.578Z] copying networkx/algorithms/flow/tests/test_maxflow.py -> build/lib/networkx/algorithms/flow/tests
[2022-03-09T08:26:35.578Z] copying networkx/algorithms/flow/tests/test_maxflow_large_graph.py -> build/lib/networkx/algorithms/flow/tests
[2022-03-09T08:26:35.578Z] copying networkx/algorithms/flow/tests/gl1.gpickle.bz2 -> build/lib/networkx/algorithms/flow/tests
[2022-03-09T08:26:35.578Z] copying networkx/algorithms/flow/tests/netgen-2.gpickle.bz2 -> build/lib/networkx/algorithms/flow/tests
[2022-03-09T08:26:35.578Z] copying networkx/algorithms/flow/tests/wlm3.gpickle.bz2 -> build/lib/networkx/algorithms/flow/tests
[2022-03-09T08:26:35.578Z] copying networkx/algorithms/flow/tests/gw1.gpickle.bz2 -> build/lib/networkx/algorithms/flow/tests
[2022-03-09T08:26:35.578Z] creating build/lib/networkx/algorithms/minors/tests
[2022-03-09T08:26:35.578Z] copying networkx/algorithms/minors/tests/test_contraction.py -> build/lib/networkx/algorithms/minors/tests
[2022-03-09T08:26:35.578Z] creating build/lib/networkx/algorithms/traversal/tests
[2022-03-09T08:26:35.578Z] copying networkx/algorithms/traversal/tests/__init__.py -> build/lib/networkx/algorithms/traversal/tests
[2022-03-09T08:26:35.578Z] copying networkx/algorithms/traversal/tests/test_bfs.py -> build/lib/networkx/algorithms/traversal/tests
[2022-03-09T08:26:35.578Z] copying networkx/algorithms/traversal/tests/test_edgebfs.py -> build/lib/networkx/algorithms/traversal/tests
[2022-03-09T08:26:35.578Z] copying networkx/algorithms/traversal/tests/test_edgedfs.py -> build/lib/networkx/algorithms/traversal/tests
[2022-03-09T08:26:35.578Z] copying networkx/algorithms/traversal/tests/test_beamsearch.py -> build/lib/networkx/algorithms/traversal/tests
[2022-03-09T08:26:35.578Z] copying networkx/algorithms/traversal/tests/test_dfs.py -> build/lib/networkx/algorithms/traversal/tests
[2022-03-09T08:26:35.578Z] creating build/lib/networkx/algorithms/isomorphism/tests
[2022-03-09T08:26:35.578Z] copying networkx/algorithms/isomorphism/tests/__init__.py -> build/lib/networkx/algorithms/isomorphism/tests
[2022-03-09T08:26:35.578Z] copying networkx/algorithms/isomorphism/tests/test_isomorphism.py -> build/lib/networkx/algorithms/isomorphism/tests
[2022-03-09T08:26:35.578Z] copying networkx/algorithms/isomorphism/tests/test_ismags.py -> build/lib/networkx/algorithms/isomorphism/tests
[2022-03-09T08:26:35.578Z] copying networkx/algorithms/isomorphism/tests/test_match_helpers.py -> build/lib/networkx/algorithms/isomorphism/tests
[2022-03-09T08:26:35.578Z] copying networkx/algorithms/isomorphism/tests/test_temporalisomorphvf2.py -> build/lib/networkx/algorithms/isomorphism/tests
[2022-03-09T08:26:35.578Z] copying networkx/algorithms/isomorphism/tests/test_isomorphvf2.py -> build/lib/networkx/algorithms/isomorphism/tests
[2022-03-09T08:26:35.578Z] copying networkx/algorithms/isomorphism/tests/test_vf2userfunc.py -> build/lib/networkx/algorithms/isomorphism/tests
[2022-03-09T08:26:35.578Z] copying networkx/algorithms/isomorphism/tests/test_tree_isomorphism.py -> build/lib/networkx/algorithms/isomorphism/tests
[2022-03-09T08:26:35.578Z] copying networkx/algorithms/isomorphism/tests/si2_b06_m200.B99 -> build/lib/networkx/algorithms/isomorphism/tests
[2022-03-09T08:26:35.578Z] copying networkx/algorithms/isomorphism/tests/iso_r01_s80.B99 -> build/lib/networkx/algorithms/isomorphism/tests
[2022-03-09T08:26:35.578Z] copying networkx/algorithms/isomorphism/tests/iso_r01_s80.A99 -> build/lib/networkx/algorithms/isomorphism/tests
[2022-03-09T08:26:35.578Z] copying networkx/algorithms/isomorphism/tests/si2_b06_m200.A99 -> build/lib/networkx/algorithms/isomorphism/tests
[2022-03-09T08:26:35.578Z] creating build/lib/networkx/algorithms/shortest_paths/tests
[2022-03-09T08:26:35.578Z] copying networkx/algorithms/shortest_paths/tests/test_astar.py -> build/lib/networkx/algorithms/shortest_paths/tests
[2022-03-09T08:26:35.578Z] copying networkx/algorithms/shortest_paths/tests/__init__.py -> build/lib/networkx/algorithms/shortest_paths/tests
[2022-03-09T08:26:35.579Z] copying networkx/algorithms/shortest_paths/tests/test_dense_numpy.py -> build/lib/networkx/algorithms/shortest_paths/tests
[2022-03-09T08:26:35.579Z] copying networkx/algorithms/shortest_paths/tests/test_weighted.py -> build/lib/networkx/algorithms/shortest_paths/tests
[2022-03-09T08:26:35.579Z] copying networkx/algorithms/shortest_paths/tests/test_dense.py -> build/lib/networkx/algorithms/shortest_paths/tests
[2022-03-09T08:26:35.579Z] copying networkx/algorithms/shortest_paths/tests/test_generic.py -> build/lib/networkx/algorithms/shortest_paths/tests
[2022-03-09T08:26:35.579Z] copying networkx/algorithms/shortest_paths/tests/test_unweighted.py -> build/lib/networkx/algorithms/shortest_paths/tests
[2022-03-09T08:26:35.579Z] creating build/lib/networkx/algorithms/link_analysis/tests
[2022-03-09T08:26:35.579Z] copying networkx/algorithms/link_analysis/tests/__init__.py -> build/lib/networkx/algorithms/link_analysis/tests
[2022-03-09T08:26:35.579Z] copying networkx/algorithms/link_analysis/tests/test_pagerank.py -> build/lib/networkx/algorithms/link_analysis/tests
[2022-03-09T08:26:35.579Z] copying networkx/algorithms/link_analysis/tests/test_hits.py -> build/lib/networkx/algorithms/link_analysis/tests
[2022-03-09T08:26:35.579Z] creating build/lib/networkx/algorithms/operators/tests
[2022-03-09T08:26:35.579Z] copying networkx/algorithms/operators/tests/__init__.py -> build/lib/networkx/algorithms/operators/tests
[2022-03-09T08:26:35.579Z] copying networkx/algorithms/operators/tests/test_product.py -> build/lib/networkx/algorithms/operators/tests
[2022-03-09T08:26:35.579Z] copying networkx/algorithms/operators/tests/test_all.py -> build/lib/networkx/algorithms/operators/tests
[2022-03-09T08:26:35.579Z] copying networkx/algorithms/operators/tests/test_unary.py -> build/lib/networkx/algorithms/operators/tests
[2022-03-09T08:26:35.579Z] copying networkx/algorithms/operators/tests/test_binary.py -> build/lib/networkx/algorithms/operators/tests
[2022-03-09T08:26:35.579Z] creating build/lib/networkx/algorithms/approximation/tests
[2022-03-09T08:26:35.579Z] copying networkx/algorithms/approximation/tests/test_clique.py -> build/lib/networkx/algorithms/approximation/tests
[2022-03-09T08:26:35.579Z] copying networkx/algorithms/approximation/tests/test_steinertree.py -> build/lib/networkx/algorithms/approximation/tests
[2022-03-09T08:26:35.579Z] copying networkx/algorithms/approximation/tests/__init__.py -> build/lib/networkx/algorithms/approximation/tests
[2022-03-09T08:26:35.579Z] copying networkx/algorithms/approximation/tests/test_connectivity.py -> build/lib/networkx/algorithms/approximation/tests
[2022-03-09T08:26:35.579Z] copying networkx/algorithms/approximation/tests/test_vertex_cover.py -> build/lib/networkx/algorithms/approximation/tests
[2022-03-09T08:26:35.579Z] copying networkx/algorithms/approximation/tests/test_traveling_salesman.py -> build/lib/networkx/algorithms/approximation/tests
[2022-03-09T08:26:35.579Z] copying networkx/algorithms/approximation/tests/test_maxcut.py -> build/lib/networkx/algorithms/approximation/tests
[2022-03-09T08:26:35.579Z] copying networkx/algorithms/approximation/tests/test_dominating_set.py -> build/lib/networkx/algorithms/approximation/tests
[2022-03-09T08:26:35.579Z] copying networkx/algorithms/approximation/tests/test_treewidth.py -> build/lib/networkx/algorithms/approximation/tests
[2022-03-09T08:26:35.579Z] copying networkx/algorithms/approximation/tests/test_distance_measures.py -> build/lib/networkx/algorithms/approximation/tests
[2022-03-09T08:26:35.579Z] copying networkx/algorithms/approximation/tests/test_kcomponents.py -> build/lib/networkx/algorithms/approximation/tests
[2022-03-09T08:26:35.579Z] copying networkx/algorithms/approximation/tests/test_approx_clust_coeff.py -> build/lib/networkx/algorithms/approximation/tests
[2022-03-09T08:26:35.579Z] copying networkx/algorithms/approximation/tests/test_ramsey.py -> build/lib/networkx/algorithms/approximation/tests
[2022-03-09T08:26:35.579Z] copying networkx/algorithms/approximation/tests/test_matching.py -> build/lib/networkx/algorithms/approximation/tests
[2022-03-09T08:26:35.579Z] creating build/lib/networkx/algorithms/tree/tests
[2022-03-09T08:26:35.579Z] copying networkx/algorithms/tree/tests/__init__.py -> build/lib/networkx/algorithms/tree/tests
[2022-03-09T08:26:35.579Z] copying networkx/algorithms/tree/tests/test_operations.py -> build/lib/networkx/algorithms/tree/tests
[2022-03-09T08:26:35.579Z] copying networkx/algorithms/tree/tests/test_decomposition.py -> build/lib/networkx/algorithms/tree/tests
[2022-03-09T08:26:35.579Z] copying networkx/algorithms/tree/tests/test_recognition.py -> build/lib/networkx/algorithms/tree/tests
[2022-03-09T08:26:35.579Z] copying networkx/algorithms/tree/tests/test_mst.py -> build/lib/networkx/algorithms/tree/tests
[2022-03-09T08:26:35.579Z] copying networkx/algorithms/tree/tests/test_coding.py -> build/lib/networkx/algorithms/tree/tests
[2022-03-09T08:26:35.579Z] copying networkx/algorithms/tree/tests/test_branchings.py -> build/lib/networkx/algorithms/tree/tests
[2022-03-09T08:26:35.579Z] creating build/lib/networkx/classes/tests
[2022-03-09T08:26:35.579Z] copying networkx/classes/tests/test_graphviews.py -> build/lib/networkx/classes/tests
[2022-03-09T08:26:35.579Z] copying networkx/classes/tests/__init__.py -> build/lib/networkx/classes/tests
[2022-03-09T08:26:35.579Z] copying networkx/classes/tests/test_graph_historical.py -> build/lib/networkx/classes/tests
[2022-03-09T08:26:35.579Z] copying networkx/classes/tests/test_filters.py -> build/lib/networkx/classes/tests
[2022-03-09T08:26:35.579Z] copying networkx/classes/tests/test_function.py -> build/lib/networkx/classes/tests
[2022-03-09T08:26:35.579Z] copying networkx/classes/tests/test_reportviews.py -> build/lib/networkx/classes/tests
[2022-03-09T08:26:35.580Z] copying networkx/classes/tests/test_multigraph.py -> build/lib/networkx/classes/tests
[2022-03-09T08:26:35.580Z] copying networkx/classes/tests/historical_tests.py -> build/lib/networkx/classes/tests
[2022-03-09T08:26:35.580Z] copying networkx/classes/tests/test_graph.py -> build/lib/networkx/classes/tests
[2022-03-09T08:26:35.580Z] copying networkx/classes/tests/test_multidigraph.py -> build/lib/networkx/classes/tests
[2022-03-09T08:26:35.580Z] copying networkx/classes/tests/test_digraph_historical.py -> build/lib/networkx/classes/tests
[2022-03-09T08:26:35.580Z] copying networkx/classes/tests/test_digraph.py -> build/lib/networkx/classes/tests
[2022-03-09T08:26:35.580Z] copying networkx/classes/tests/test_coreviews.py -> build/lib/networkx/classes/tests
[2022-03-09T08:26:35.580Z] copying networkx/classes/tests/test_special.py -> build/lib/networkx/classes/tests
[2022-03-09T08:26:35.580Z] copying networkx/classes/tests/test_subgraphviews.py -> build/lib/networkx/classes/tests
[2022-03-09T08:26:35.580Z] copying networkx/classes/tests/test_ordered.py -> build/lib/networkx/classes/tests
[2022-03-09T08:26:35.580Z] creating build/lib/networkx/generators/tests
[2022-03-09T08:26:35.580Z] copying networkx/generators/tests/test_degree_seq.py -> build/lib/networkx/generators/tests
[2022-03-09T08:26:35.580Z] copying networkx/generators/tests/__init__.py -> build/lib/networkx/generators/tests
[2022-03-09T08:26:35.580Z] copying networkx/generators/tests/test_interval_graph.py -> build/lib/networkx/generators/tests
[2022-03-09T08:26:35.580Z] copying networkx/generators/tests/test_geometric.py -> build/lib/networkx/generators/tests
[2022-03-09T08:26:35.580Z] copying networkx/generators/tests/test_intersection.py -> build/lib/networkx/generators/tests
[2022-03-09T08:26:35.580Z] copying networkx/generators/tests/test_trees.py -> build/lib/networkx/generators/tests
[2022-03-09T08:26:35.580Z] copying networkx/generators/tests/test_harary_graph.py -> build/lib/networkx/generators/tests
[2022-03-09T08:26:35.580Z] copying networkx/generators/tests/test_line.py -> build/lib/networkx/generators/tests
[2022-03-09T08:26:35.580Z] copying networkx/generators/tests/test_sudoku.py -> build/lib/networkx/generators/tests
[2022-03-09T08:26:35.580Z] copying networkx/generators/tests/test_duplication.py -> build/lib/networkx/generators/tests
[2022-03-09T08:26:35.580Z] copying networkx/generators/tests/test_small.py -> build/lib/networkx/generators/tests
[2022-03-09T08:26:35.580Z] copying networkx/generators/tests/test_ego.py -> build/lib/networkx/generators/tests
[2022-03-09T08:26:35.580Z] copying networkx/generators/tests/test_community.py -> build/lib/networkx/generators/tests
[2022-03-09T08:26:35.580Z] copying networkx/generators/tests/test_cographs.py -> build/lib/networkx/generators/tests
[2022-03-09T08:26:35.580Z] copying networkx/generators/tests/test_directed.py -> build/lib/networkx/generators/tests
[2022-03-09T08:26:35.580Z] copying networkx/generators/tests/test_spectral_graph_forge.py -> build/lib/networkx/generators/tests
[2022-03-09T08:26:35.580Z] copying networkx/generators/tests/test_atlas.py -> build/lib/networkx/generators/tests
[2022-03-09T08:26:35.580Z] copying networkx/generators/tests/test_lattice.py -> build/lib/networkx/generators/tests
[2022-03-09T08:26:35.580Z] copying networkx/generators/tests/test_classic.py -> build/lib/networkx/generators/tests
[2022-03-09T08:26:35.580Z] copying networkx/generators/tests/test_stochastic.py -> build/lib/networkx/generators/tests
[2022-03-09T08:26:35.580Z] copying networkx/generators/tests/test_random_clustered.py -> build/lib/networkx/generators/tests
[2022-03-09T08:26:35.580Z] copying networkx/generators/tests/test_random_graphs.py -> build/lib/networkx/generators/tests
[2022-03-09T08:26:35.580Z] copying networkx/generators/tests/test_joint_degree_seq.py -> build/lib/networkx/generators/tests
[2022-03-09T08:26:35.580Z] copying networkx/generators/tests/test_expanders.py -> build/lib/networkx/generators/tests
[2022-03-09T08:26:35.580Z] copying networkx/generators/tests/test_mycielski.py -> build/lib/networkx/generators/tests
[2022-03-09T08:26:35.580Z] copying networkx/generators/tests/test_triads.py -> build/lib/networkx/generators/tests
[2022-03-09T08:26:35.580Z] copying networkx/generators/tests/test_internet_as_graphs.py -> build/lib/networkx/generators/tests
[2022-03-09T08:26:35.580Z] copying networkx/generators/tests/test_nonisomorphic_trees.py -> build/lib/networkx/generators/tests
[2022-03-09T08:26:35.580Z] copying networkx/generators/atlas.dat.gz -> build/lib/networkx/generators
[2022-03-09T08:26:35.580Z] creating build/lib/networkx/drawing/tests
[2022-03-09T08:26:35.580Z] copying networkx/drawing/tests/__init__.py -> build/lib/networkx/drawing/tests
[2022-03-09T08:26:35.580Z] copying networkx/drawing/tests/test_layout.py -> build/lib/networkx/drawing/tests
[2022-03-09T08:26:35.580Z] copying networkx/drawing/tests/test_pydot.py -> build/lib/networkx/drawing/tests
[2022-03-09T08:26:35.580Z] copying networkx/drawing/tests/test_agraph.py -> build/lib/networkx/drawing/tests
[2022-03-09T08:26:35.580Z] copying networkx/drawing/tests/test_pylab.py -> build/lib/networkx/drawing/tests
[2022-03-09T08:26:35.580Z] creating build/lib/networkx/drawing/tests/baseline
[2022-03-09T08:26:35.580Z] copying networkx/drawing/tests/baseline/test_house_with_colors.png -> build/lib/networkx/drawing/tests/baseline
[2022-03-09T08:26:35.581Z] creating build/lib/networkx/linalg/tests
[2022-03-09T08:26:35.581Z] copying networkx/linalg/tests/__init__.py -> build/lib/networkx/linalg/tests
[2022-03-09T08:26:35.581Z] copying networkx/linalg/tests/test_bethehessian.py -> build/lib/networkx/linalg/tests
[2022-03-09T08:26:35.581Z] copying networkx/linalg/tests/test_laplacian.py -> build/lib/networkx/linalg/tests
[2022-03-09T08:26:35.581Z] copying networkx/linalg/tests/test_modularity.py -> build/lib/networkx/linalg/tests
[2022-03-09T08:26:35.581Z] copying networkx/linalg/tests/test_algebraic_connectivity.py -> build/lib/networkx/linalg/tests
[2022-03-09T08:26:35.581Z] copying networkx/linalg/tests/test_spectrum.py -> build/lib/networkx/linalg/tests
[2022-03-09T08:26:35.581Z] copying networkx/linalg/tests/test_attrmatrix.py -> build/lib/networkx/linalg/tests
[2022-03-09T08:26:35.581Z] copying networkx/linalg/tests/test_graphmatrix.py -> build/lib/networkx/linalg/tests
[2022-03-09T08:26:35.581Z] creating build/lib/networkx/readwrite/tests
[2022-03-09T08:26:35.581Z] copying networkx/readwrite/tests/__init__.py -> build/lib/networkx/readwrite/tests
[2022-03-09T08:26:35.581Z] copying networkx/readwrite/tests/test_adjlist.py -> build/lib/networkx/readwrite/tests
[2022-03-09T08:26:35.581Z] copying networkx/readwrite/tests/test_shp.py -> build/lib/networkx/readwrite/tests
[2022-03-09T08:26:35.581Z] copying networkx/readwrite/tests/test_getattr_nxyaml_removal.py -> build/lib/networkx/readwrite/tests
[2022-03-09T08:26:35.581Z] copying networkx/readwrite/tests/test_gml.py -> build/lib/networkx/readwrite/tests
[2022-03-09T08:26:35.581Z] copying networkx/readwrite/tests/test_sparse6.py -> build/lib/networkx/readwrite/tests
[2022-03-09T08:26:35.581Z] copying networkx/readwrite/tests/test_leda.py -> build/lib/networkx/readwrite/tests
[2022-03-09T08:26:35.581Z] copying networkx/readwrite/tests/test_graph6.py -> build/lib/networkx/readwrite/tests
[2022-03-09T08:26:35.581Z] copying networkx/readwrite/tests/test_edgelist.py -> build/lib/networkx/readwrite/tests
[2022-03-09T08:26:35.581Z] copying networkx/readwrite/tests/test_text.py -> build/lib/networkx/readwrite/tests
[2022-03-09T08:26:35.581Z] copying networkx/readwrite/tests/test_graphml.py -> build/lib/networkx/readwrite/tests
[2022-03-09T08:26:35.581Z] copying networkx/readwrite/tests/test_p2g.py -> build/lib/networkx/readwrite/tests
[2022-03-09T08:26:35.581Z] copying networkx/readwrite/tests/test_gexf.py -> build/lib/networkx/readwrite/tests
[2022-03-09T08:26:35.581Z] copying networkx/readwrite/tests/test_gpickle.py -> build/lib/networkx/readwrite/tests
[2022-03-09T08:26:35.581Z] copying networkx/readwrite/tests/test_pajek.py -> build/lib/networkx/readwrite/tests
[2022-03-09T08:26:35.581Z] creating build/lib/networkx/readwrite/json_graph/tests
[2022-03-09T08:26:35.581Z] copying networkx/readwrite/json_graph/tests/__init__.py -> build/lib/networkx/readwrite/json_graph/tests
[2022-03-09T08:26:35.581Z] copying networkx/readwrite/json_graph/tests/test_jit.py -> build/lib/networkx/readwrite/json_graph/tests
[2022-03-09T08:26:35.581Z] copying networkx/readwrite/json_graph/tests/test_tree.py -> build/lib/networkx/readwrite/json_graph/tests
[2022-03-09T08:26:35.581Z] copying networkx/readwrite/json_graph/tests/test_node_link.py -> build/lib/networkx/readwrite/json_graph/tests
[2022-03-09T08:26:35.581Z] copying networkx/readwrite/json_graph/tests/test_cytoscape.py -> build/lib/networkx/readwrite/json_graph/tests
[2022-03-09T08:26:35.581Z] copying networkx/readwrite/json_graph/tests/test_adjacency.py -> build/lib/networkx/readwrite/json_graph/tests
[2022-03-09T08:26:35.581Z] creating build/lib/networkx/testing/tests
[2022-03-09T08:26:35.581Z] copying networkx/testing/tests/__init__.py -> build/lib/networkx/testing/tests
[2022-03-09T08:26:35.581Z] copying networkx/testing/tests/test_utils.py -> build/lib/networkx/testing/tests
[2022-03-09T08:26:35.581Z] creating build/lib/networkx/utils/tests
[2022-03-09T08:26:35.581Z] copying networkx/utils/tests/test_unionfind.py -> build/lib/networkx/utils/tests
[2022-03-09T08:26:35.581Z] copying networkx/utils/tests/__init__.py -> build/lib/networkx/utils/tests
[2022-03-09T08:26:35.581Z] copying networkx/utils/tests/test_rcm.py -> build/lib/networkx/utils/tests
[2022-03-09T08:26:35.581Z] copying networkx/utils/tests/test_random_sequence.py -> build/lib/networkx/utils/tests
[2022-03-09T08:26:35.581Z] copying networkx/utils/tests/test_heaps.py -> build/lib/networkx/utils/tests
[2022-03-09T08:26:35.581Z] copying networkx/utils/tests/test__init.py -> build/lib/networkx/utils/tests
[2022-03-09T08:26:35.581Z] copying networkx/utils/tests/test_decorators.py -> build/lib/networkx/utils/tests
[2022-03-09T08:26:35.581Z] copying networkx/utils/tests/test_mapped_queue.py -> build/lib/networkx/utils/tests
[2022-03-09T08:26:35.581Z] copying networkx/utils/tests/test_contextmanager.py -> build/lib/networkx/utils/tests
[2022-03-09T08:26:35.581Z] copying networkx/utils/tests/test_misc.py -> build/lib/networkx/utils/tests
[2022-03-09T08:26:35.581Z] ==> Starting check()...
[2022-03-09T08:26:35.832Z] running pytest
[2022-03-09T08:26:35.832Z] running egg_info
[2022-03-09T08:26:35.832Z] creating networkx.egg-info
[2022-03-09T08:26:35.832Z] writing networkx.egg-info/PKG-INFO
[2022-03-09T08:26:35.832Z] writing dependency_links to networkx.egg-info/dependency_links.txt
[2022-03-09T08:26:35.832Z] writing requirements to networkx.egg-info/requires.txt
[2022-03-09T08:26:35.832Z] writing top-level names to networkx.egg-info/top_level.txt
[2022-03-09T08:26:35.832Z] writing manifest file 'networkx.egg-info/SOURCES.txt'
[2022-03-09T08:26:35.832Z] reading manifest file 'networkx.egg-info/SOURCES.txt'
[2022-03-09T08:26:35.832Z] reading manifest template 'MANIFEST.in'
[2022-03-09T08:26:35.832Z] warning: no files found matching '*.txt' under directory 'doc'
[2022-03-09T08:26:35.832Z] warning: no files found matching '*.inc' under directory 'doc'
[2022-03-09T08:26:36.082Z] warning: no previously-included files matching '*~' found anywhere in distribution
[2022-03-09T08:26:36.082Z] warning: no previously-included files matching '*.pyc' found anywhere in distribution
[2022-03-09T08:26:36.082Z] warning: no previously-included files matching '.svn' found anywhere in distribution
[2022-03-09T08:26:36.082Z] no previously-included directories found matching 'doc/build'
[2022-03-09T08:26:36.082Z] no previously-included directories found matching 'doc/auto_examples'
[2022-03-09T08:26:36.082Z] no previously-included directories found matching 'doc/modules'
[2022-03-09T08:26:36.082Z] no previously-included directories found matching 'doc/reference/generated'
[2022-03-09T08:26:36.082Z] no previously-included directories found matching 'doc/reference/algorithms/generated'
[2022-03-09T08:26:36.082Z] no previously-included directories found matching 'doc/reference/classes/generated'
[2022-03-09T08:26:36.082Z] no previously-included directories found matching 'doc/reference/readwrite/generated'
[2022-03-09T08:26:36.082Z] adding license file 'LICENSE.txt'
[2022-03-09T08:26:36.082Z] writing manifest file 'networkx.egg-info/SOURCES.txt'
[2022-03-09T08:26:36.082Z] running build_ext
[2022-03-09T08:26:48.178Z] ============================= test session starts ==============================
[2022-03-09T08:26:48.178Z] platform linux -- Python 3.10.2, pytest-7.0.1, pluggy-0.13.1
[2022-03-09T08:26:48.178Z] rootdir: /build/python-networkx/src/networkx-networkx-2.7
[2022-03-09T08:26:48.178Z] collected 4875 items / 2 skipped / 4873 selected
[2022-03-09T08:26:48.178Z]
[2022-03-09T08:26:48.178Z] networkx/algorithms/approximation/tests/test_approx_clust_coeff.py ..... [ 0%]
[2022-03-09T08:26:48.178Z] . [ 0%]
[2022-03-09T08:26:48.178Z] networkx/algorithms/approximation/tests/test_clique.py ........ [ 0%]
[2022-03-09T08:26:48.178Z] networkx/algorithms/approximation/tests/test_connectivity.py ........... [ 0%]
[2022-03-09T08:26:48.178Z] ....... [ 0%]
[2022-03-09T08:26:48.178Z] networkx/algorithms/approximation/tests/test_distance_measures.py ...... [ 0%]
[2022-03-09T08:26:48.178Z] .. [ 0%]
[2022-03-09T08:26:48.178Z] networkx/algorithms/approximation/tests/test_dominating_set.py ... [ 0%]
[2022-03-09T08:26:55.004Z] networkx/algorithms/approximation/tests/test_kcomponents.py ............ [ 1%]
[2022-03-09T08:26:55.004Z] .... [ 1%]
[2022-03-09T08:26:55.004Z] networkx/algorithms/approximation/tests/test_matching.py . [ 1%]
[2022-03-09T08:26:55.004Z] networkx/algorithms/approximation/tests/test_maxcut.py ..... [ 1%]
[2022-03-09T08:26:55.004Z] networkx/algorithms/approximation/tests/test_ramsey.py . [ 1%]
[2022-03-09T08:26:55.004Z] networkx/algorithms/approximation/tests/test_steinertree.py .... [ 1%]
[2022-03-09T08:26:55.004Z] networkx/algorithms/approximation/tests/test_traveling_salesman.py ..... [ 1%]
[2022-03-09T08:26:56.756Z] .......................FFFFFF..sFFF...s. [ 2%]
[2022-03-09T08:26:56.756Z] networkx/algorithms/approximation/tests/test_treewidth.py ............ [ 2%]
[2022-03-09T08:26:56.756Z] networkx/algorithms/approximation/tests/test_vertex_cover.py .... [ 2%]
[2022-03-09T08:26:56.756Z] networkx/algorithms/assortativity/tests/test_connectivity.py .......... [ 2%]
[2022-03-09T08:26:58.057Z] networkx/algorithms/assortativity/tests/test_correlation.py ....FFFF.... [ 3%]
[2022-03-09T08:26:58.057Z] ....... [ 3%]
[2022-03-09T08:26:58.057Z] networkx/algorithms/assortativity/tests/test_mixing.py ................. [ 3%]
[2022-03-09T08:26:58.057Z] .. [ 3%]
[2022-03-09T08:26:58.057Z] networkx/algorithms/assortativity/tests/test_neighbor_degree.py ...... [ 3%]
[2022-03-09T08:26:58.057Z] networkx/algorithms/assortativity/tests/test_pairs.py ........... [ 4%]
[2022-03-09T08:26:58.057Z] networkx/algorithms/bipartite/tests/test_basic.py ............... [ 4%]
[2022-03-09T08:26:58.057Z] networkx/algorithms/bipartite/tests/test_centrality.py ...... [ 4%]
[2022-03-09T08:26:58.057Z] networkx/algorithms/bipartite/tests/test_cluster.py ......... [ 4%]
[2022-03-09T08:26:58.057Z] networkx/algorithms/bipartite/tests/test_covering.py .... [ 4%]
[2022-03-09T08:26:58.057Z] networkx/algorithms/bipartite/tests/test_edgelist.py .............. [ 5%]
[2022-03-09T08:26:58.308Z] networkx/algorithms/bipartite/tests/test_generators.py .......... [ 5%]
[2022-03-09T08:26:59.058Z] networkx/algorithms/bipartite/tests/test_matching.py ............FFFFFFF [ 5%]
[2022-03-09T08:26:59.058Z] F [ 5%]
[2022-03-09T08:26:59.058Z] networkx/algorithms/bipartite/tests/test_matrix.py ........... [ 5%]
[2022-03-09T08:26:59.059Z] networkx/algorithms/bipartite/tests/test_project.py ................. [ 6%]
[2022-03-09T08:26:59.059Z] networkx/algorithms/bipartite/tests/test_redundancy.py ... [ 6%]
[2022-03-09T08:26:59.309Z] networkx/algorithms/bipartite/tests/test_spectral_bipartivity.py ... [ 6%]
[2022-03-09T08:26:59.309Z] networkx/algorithms/centrality/tests/test_betweenness_centrality.py .... [ 6%]
[2022-03-09T08:26:59.309Z] ..................................... [ 7%]
[2022-03-09T08:26:59.309Z] networkx/algorithms/centrality/tests/test_betweenness_centrality_subset.py . [ 7%]
[2022-03-09T08:26:59.309Z] ................ [ 7%]
[2022-03-09T08:26:59.309Z] networkx/algorithms/centrality/tests/test_closeness_centrality.py ...... [ 7%]
[2022-03-09T08:26:59.559Z] ....... [ 7%]
[2022-03-09T08:26:59.559Z] networkx/algorithms/centrality/tests/test_current_flow_betweenness_centrality.py . [ 7%]
[2022-03-09T08:27:00.610Z] ............... [ 8%]
[2022-03-09T08:27:00.610Z] networkx/algorithms/centrality/tests/test_current_flow_betweenness_centrality_subset.py . [ 8%]
[2022-03-09T08:27:00.861Z] ........ [ 8%]
[2022-03-09T08:27:00.861Z] networkx/algorithms/centrality/tests/test_current_flow_closeness.py ... [ 8%]
[2022-03-09T08:27:00.861Z] networkx/algorithms/centrality/tests/test_degree_centrality.py ....... [ 8%]
[2022-03-09T08:27:00.861Z] networkx/algorithms/centrality/tests/test_dispersion.py ... [ 8%]
[2022-03-09T08:27:00.861Z] networkx/algorithms/centrality/tests/test_eigenvector_centrality.py .... [ 8%]
[2022-03-09T08:27:00.861Z] ........ [ 8%]
[2022-03-09T08:27:01.111Z] networkx/algorithms/centrality/tests/test_group.py ..................... [ 9%]
[2022-03-09T08:27:01.111Z] ... [ 9%]
[2022-03-09T08:27:01.111Z] networkx/algorithms/centrality/tests/test_harmonic_centrality.py ....... [ 9%]
[2022-03-09T08:27:01.111Z] ...... [ 9%]
[2022-03-09T08:27:01.362Z] networkx/algorithms/centrality/tests/test_katz_centrality.py ........... [ 9%]
[2022-03-09T08:27:01.362Z] ............... [ 10%]
[2022-03-09T08:27:01.362Z] networkx/algorithms/centrality/tests/test_load_centrality.py ........... [ 10%]
[2022-03-09T08:27:01.362Z] ...... [ 10%]
[2022-03-09T08:27:01.362Z] networkx/algorithms/centrality/tests/test_percolation_centrality.py ... [ 10%]
[2022-03-09T08:27:01.362Z] networkx/algorithms/centrality/tests/test_reaching.py .............. [ 10%]
[2022-03-09T08:27:01.362Z] networkx/algorithms/centrality/tests/test_second_order_centrality.py ... [ 10%]
[2022-03-09T08:27:01.362Z] .... [ 10%]
[2022-03-09T08:27:01.612Z] networkx/algorithms/centrality/tests/test_subgraph.py ..... [ 11%]
[2022-03-09T08:27:01.612Z] networkx/algorithms/centrality/tests/test_trophic.py .......... [ 11%]
[2022-03-09T08:27:01.612Z] networkx/algorithms/centrality/tests/test_voterank.py ..... [ 11%]
[2022-03-09T08:27:01.862Z] networkx/algorithms/coloring/tests/test_coloring.py ................ [ 11%]
[2022-03-09T08:27:01.862Z] networkx/algorithms/community/tests/test_asyn_fluid.py ..... [ 11%]
[2022-03-09T08:27:01.863Z] networkx/algorithms/community/tests/test_centrality.py ..... [ 11%]
[2022-03-09T08:27:01.863Z] networkx/algorithms/community/tests/test_kclique.py ........ [ 12%]
[2022-03-09T08:27:01.863Z] networkx/algorithms/community/tests/test_kernighan_lin.py ........ [ 12%]
[2022-03-09T08:27:01.863Z] networkx/algorithms/community/tests/test_label_propagation.py .......... [ 12%]
[2022-03-09T08:27:01.863Z] . [ 12%]
[2022-03-09T08:27:02.363Z] networkx/algorithms/community/tests/test_louvain.py ........ [ 12%]
[2022-03-09T08:27:02.363Z] networkx/algorithms/community/tests/test_lukes.py .... [ 12%]
[2022-03-09T08:27:04.846Z] networkx/algorithms/community/tests/test_modularity_max.py ............. [ 12%]
[2022-03-09T08:27:05.096Z] ... [ 13%]
[2022-03-09T08:27:05.346Z] networkx/algorithms/community/tests/test_quality.py ....... [ 13%]
[2022-03-09T08:27:05.346Z] networkx/algorithms/community/tests/test_utils.py .... [ 13%]
[2022-03-09T08:27:05.346Z] networkx/algorithms/components/tests/test_attracting.py .... [ 13%]
[2022-03-09T08:27:05.346Z] networkx/algorithms/components/tests/test_biconnected.py ............. [ 13%]
[2022-03-09T08:27:05.346Z] networkx/algorithms/components/tests/test_connected.py ........ [ 13%]
[2022-03-09T08:27:05.346Z] networkx/algorithms/components/tests/test_semiconnected.py ........ [ 13%]
[2022-03-09T08:27:05.346Z] networkx/algorithms/components/tests/test_strongly_connected.py ........ [ 14%]
[2022-03-09T08:27:05.346Z] ...... [ 14%]
[2022-03-09T08:27:05.346Z] networkx/algorithms/components/tests/test_weakly_connected.py ...... [ 14%]
[2022-03-09T08:27:08.208Z] networkx/algorithms/connectivity/tests/test_connectivity.py ............ [ 14%]
[2022-03-09T08:27:08.709Z] ...................... [ 15%]
[2022-03-09T08:27:14.048Z] networkx/algorithms/connectivity/tests/test_cuts.py .................... [ 15%]
[2022-03-09T08:27:14.048Z] . [ 15%]
[2022-03-09T08:27:14.298Z] networkx/algorithms/connectivity/tests/test_disjoint_paths.py .......... [ 15%]
[2022-03-09T08:27:14.298Z] ........ [ 15%]
[2022-03-09T08:27:14.298Z] networkx/algorithms/connectivity/tests/test_edge_augmentation.py ....... [ 15%]
[2022-03-09T08:27:15.349Z] ............. [ 16%]
[2022-03-09T08:27:16.150Z] networkx/algorithms/connectivity/tests/test_edge_kcomponents.py ........ [ 16%]
[2022-03-09T08:27:17.751Z] ............. [ 16%]
[2022-03-09T08:27:20.264Z] networkx/algorithms/connectivity/tests/test_kcomponents.py .sss...... [ 16%]
[2022-03-09T08:27:27.920Z] networkx/algorithms/connectivity/tests/test_kcutsets.py s........s..... [ 17%]
[2022-03-09T08:27:27.920Z] networkx/algorithms/connectivity/tests/test_stoer_wagner.py ..... [ 17%]
[2022-03-09T08:27:34.932Z] networkx/algorithms/flow/tests/test_gomory_hu.py ....s.... [ 17%]
[2022-03-09T08:27:35.483Z] networkx/algorithms/flow/tests/test_maxflow.py ......................... [ 17%]
[2022-03-09T08:27:35.734Z] .. [ 18%]
[2022-03-09T08:27:37.336Z] networkx/algorithms/flow/tests/test_maxflow_large_graph.py ...s.. [ 18%]
[2022-03-09T08:27:38.679Z] networkx/algorithms/flow/tests/test_mincost.py ................... [ 18%]
[2022-03-09T08:27:38.679Z] networkx/algorithms/flow/tests/test_networksimplex.py .................. [ 18%]
[2022-03-09T08:27:38.679Z] .... [ 18%]
[2022-03-09T08:27:38.679Z] networkx/algorithms/isomorphism/tests/test_ismags.py .......... [ 19%]
[2022-03-09T08:27:38.679Z] networkx/algorithms/isomorphism/tests/test_isomorphism.py .... [ 19%]
[2022-03-09T08:27:39.180Z] networkx/algorithms/isomorphism/tests/test_isomorphvf2.py .............. [ 19%]
[2022-03-09T08:27:39.180Z] . [ 19%]
[2022-03-09T08:27:39.180Z] networkx/algorithms/isomorphism/tests/test_match_helpers.py .. [ 19%]
[2022-03-09T08:27:39.180Z] networkx/algorithms/isomorphism/tests/test_temporalisomorphvf2.py ...... [ 19%]
[2022-03-09T08:27:39.180Z] ...... [ 19%]
[2022-03-09T08:27:48.888Z] networkx/algorithms/isomorphism/tests/test_tree_isomorphism.py ..... [ 19%]
[2022-03-09T08:27:48.888Z] networkx/algorithms/isomorphism/tests/test_vf2userfunc.py .............. [ 20%]
[2022-03-09T08:27:48.888Z] .............. [ 20%]
[2022-03-09T08:27:48.888Z] networkx/algorithms/link_analysis/tests/test_hits.py ........ [ 20%]
[2022-03-09T08:27:48.888Z] networkx/algorithms/link_analysis/tests/test_pagerank.py ............... [ 21%]
[2022-03-09T08:27:48.888Z] ..................................... [ 21%]
[2022-03-09T08:27:48.888Z] networkx/algorithms/minors/tests/test_contraction.py ................... [ 22%]
[2022-03-09T08:27:48.888Z] ............ [ 22%]
[2022-03-09T08:27:48.888Z] networkx/algorithms/operators/tests/test_all.py .................. [ 22%]
[2022-03-09T08:27:48.888Z] networkx/algorithms/operators/tests/test_binary.py .................... [ 23%]
[2022-03-09T08:27:48.888Z] networkx/algorithms/operators/tests/test_product.py .................... [ 23%]
[2022-03-09T08:27:48.888Z] ....... [ 23%]
[2022-03-09T08:27:48.888Z] networkx/algorithms/operators/tests/test_unary.py ... [ 23%]
[2022-03-09T08:27:48.888Z] networkx/algorithms/shortest_paths/tests/test_astar.py ............. [ 24%]
[2022-03-09T08:27:48.888Z] networkx/algorithms/shortest_paths/tests/test_dense.py ........ [ 24%]
[2022-03-09T08:27:49.138Z] networkx/algorithms/shortest_paths/tests/test_dense_numpy.py ....... [ 24%]
[2022-03-09T08:27:49.138Z] networkx/algorithms/shortest_paths/tests/test_generic.py ............... [ 24%]
[2022-03-09T08:27:49.138Z] ....... [ 24%]
[2022-03-09T08:27:49.138Z] networkx/algorithms/shortest_paths/tests/test_unweighted.py ............ [ 25%]
[2022-03-09T08:27:49.138Z] [ 25%]
[2022-03-09T08:27:49.138Z] networkx/algorithms/shortest_paths/tests/test_weighted.py .............. [ 25%]
[2022-03-09T08:27:49.389Z] ....................................... [ 26%]
[2022-03-09T08:27:49.389Z] networkx/algorithms/tests/test_asteroidal.py . [ 26%]
[2022-03-09T08:27:49.389Z] networkx/algorithms/tests/test_boundary.py ............. [ 26%]
[2022-03-09T08:27:49.389Z] networkx/algorithms/tests/test_bridges.py ..... [ 26%]
[2022-03-09T08:27:49.389Z] networkx/algorithms/tests/test_chains.py .... [ 26%]
[2022-03-09T08:27:49.389Z] networkx/algorithms/tests/test_chordal.py .......... [ 26%]
[2022-03-09T08:27:49.389Z] networkx/algorithms/tests/test_clique.py .............. [ 27%]
[2022-03-09T08:27:49.639Z] networkx/algorithms/tests/test_cluster.py .............................. [ 27%]
[2022-03-09T08:27:49.639Z] .......... [ 27%]
[2022-03-09T08:27:49.639Z] networkx/algorithms/tests/test_communicability.py .. [ 27%]
[2022-03-09T08:27:49.639Z] networkx/algorithms/tests/test_core.py ............. [ 28%]
[2022-03-09T08:27:49.639Z] networkx/algorithms/tests/test_covering.py ........ [ 28%]
[2022-03-09T08:27:49.639Z] networkx/algorithms/tests/test_cuts.py ................. [ 28%]
[2022-03-09T08:27:50.190Z] networkx/algorithms/tests/test_cycles.py ............................... [ 29%]
[2022-03-09T08:27:50.190Z] ... [ 29%]
[2022-03-09T08:27:50.190Z] networkx/algorithms/tests/test_d_separation.py ............. [ 29%]
[2022-03-09T08:27:50.440Z] networkx/algorithms/tests/test_dag.py .................................. [ 30%]
[2022-03-09T08:27:50.440Z] ................... [ 30%]
[2022-03-09T08:27:50.440Z] networkx/algorithms/tests/test_distance_measures.py .................... [ 31%]
[2022-03-09T08:27:50.691Z] ....... [ 31%]
[2022-03-09T08:27:50.691Z] networkx/algorithms/tests/test_distance_regular.py ....... [ 31%]
[2022-03-09T08:27:50.691Z] networkx/algorithms/tests/test_dominance.py ...................... [ 31%]
[2022-03-09T08:27:50.691Z] networkx/algorithms/tests/test_dominating.py ..... [ 32%]
[2022-03-09T08:27:50.691Z] networkx/algorithms/tests/test_efficiency.py ....... [ 32%]
[2022-03-09T08:27:50.691Z] networkx/algorithms/tests/test_euler.py .............................. [ 32%]
[2022-03-09T08:27:59.318Z] networkx/algorithms/tests/test_graph_hashing.py ........................ [ 33%]
[2022-03-09T08:27:59.318Z] [ 33%]
[2022-03-09T08:27:59.569Z] networkx/algorithms/tests/test_graphical.py ............. [ 33%]
[2022-03-09T08:27:59.569Z] networkx/algorithms/tests/test_hierarchy.py ..... [ 33%]
[2022-03-09T08:27:59.819Z] networkx/algorithms/tests/test_hybrid.py .. [ 33%]
[2022-03-09T08:27:59.819Z] networkx/algorithms/tests/test_isolate.py ... [ 33%]
[2022-03-09T08:27:59.819Z] networkx/algorithms/tests/test_link_prediction.py ...................... [ 34%]
[2022-03-09T08:28:00.069Z] ................................................... [ 35%]
[2022-03-09T08:28:00.070Z] networkx/algorithms/tests/test_lowest_common_ancestors.py .............. [ 35%]
[2022-03-09T08:28:00.070Z] ........... [ 35%]
[2022-03-09T08:28:00.070Z] networkx/algorithms/tests/test_matching.py ............................. [ 36%]
[2022-03-09T08:28:00.070Z] ............... [ 36%]
[2022-03-09T08:28:00.070Z] networkx/algorithms/tests/test_max_weight_clique.py ..... [ 36%]
[2022-03-09T08:28:00.320Z] networkx/algorithms/tests/test_mis.py ........ [ 36%]
[2022-03-09T08:28:00.320Z] networkx/algorithms/tests/test_moral.py . [ 36%]
[2022-03-09T08:28:00.320Z] networkx/algorithms/tests/test_node_classification.py ............... [ 37%]
[2022-03-09T08:28:00.320Z] networkx/algorithms/tests/test_node_classification_deprecations.py .... [ 37%]
[2022-03-09T08:28:00.320Z] networkx/algorithms/tests/test_non_randomness.py ...... [ 37%]
[2022-03-09T08:28:00.320Z] networkx/algorithms/tests/test_planar_drawing.py ............ [ 37%]
[2022-03-09T08:28:00.570Z] networkx/algorithms/tests/test_planarity.py ............................ [ 38%]
[2022-03-09T08:28:00.570Z] .. [ 38%]
[2022-03-09T08:28:00.570Z] networkx/algorithms/tests/test_reciprocity.py ..... [ 38%]
[2022-03-09T08:28:00.570Z] networkx/algorithms/tests/test_regular.py ............. [ 38%]
[2022-03-09T08:28:00.570Z] networkx/algorithms/tests/test_richclub.py ........ [ 38%]
[2022-03-09T08:28:04.826Z] networkx/algorithms/tests/test_similarity.py FFFFFFFFFFFFFFFFFFFFFFFFFF. [ 39%]
[2022-03-09T08:28:04.826Z] ................. [ 39%]
[2022-03-09T08:28:04.826Z] networkx/algorithms/tests/test_simple_paths.py ......................... [ 40%]
[2022-03-09T08:28:05.077Z] ................................................ [ 41%]
[2022-03-09T08:28:12.114Z] networkx/algorithms/tests/test_smallworld.py .... [ 41%]
[2022-03-09T08:28:12.114Z] networkx/algorithms/tests/test_smetric.py .. [ 41%]
[2022-03-09T08:28:12.114Z] networkx/algorithms/tests/test_sparsifiers.py ....... [ 41%]
[2022-03-09T08:28:12.114Z] networkx/algorithms/tests/test_structuralholes.py ............ [ 41%]
[2022-03-09T08:28:12.114Z] networkx/algorithms/tests/test_summarization.py ................. [ 42%]
[2022-03-09T08:28:12.114Z] networkx/algorithms/tests/test_swap.py ............. [ 42%]
[2022-03-09T08:28:12.114Z] networkx/algorithms/tests/test_threshold.py .................. [ 42%]
[2022-03-09T08:28:12.114Z] networkx/algorithms/tests/test_tournament.py ..................... [ 43%]
[2022-03-09T08:28:12.114Z] networkx/algorithms/tests/test_triads.py ........ [ 43%]
[2022-03-09T08:28:12.114Z] networkx/algorithms/tests/test_vitality.py ...... [ 43%]
[2022-03-09T08:28:12.114Z] networkx/algorithms/tests/test_voronoi.py .......... [ 43%]
[2022-03-09T08:28:12.115Z] networkx/algorithms/tests/test_wiener.py .... [ 43%]
[2022-03-09T08:28:12.115Z] networkx/algorithms/traversal/tests/test_beamsearch.py .. [ 43%]
[2022-03-09T08:28:12.115Z] networkx/algorithms/traversal/tests/test_bfs.py .............. [ 44%]
[2022-03-09T08:28:12.115Z] networkx/algorithms/traversal/tests/test_dfs.py ................. [ 44%]
[2022-03-09T08:28:12.115Z] networkx/algorithms/traversal/tests/test_edgebfs.py ................ [ 44%]
[2022-03-09T08:28:12.115Z] networkx/algorithms/traversal/tests/test_edgedfs.py ............... [ 45%]
[2022-03-09T08:28:12.115Z] networkx/algorithms/tree/tests/test_branchings.py ...................... [ 45%]
[2022-03-09T08:28:18.570Z] ..... [ 45%]
[2022-03-09T08:28:18.570Z] networkx/algorithms/tree/tests/test_coding.py .............. [ 45%]
[2022-03-09T08:28:18.570Z] networkx/algorithms/tree/tests/test_decomposition.py ..... [ 46%]
[2022-03-09T08:28:18.570Z] networkx/algorithms/tree/tests/test_mst.py ............................. [ 46%]
[2022-03-09T08:28:18.570Z] ................. [ 46%]
[2022-03-09T08:28:18.570Z] networkx/algorithms/tree/tests/test_operations.py ... [ 47%]
[2022-03-09T08:28:18.570Z] networkx/algorithms/tree/tests/test_recognition.py ..................... [ 47%]
[2022-03-09T08:28:18.570Z] .... [ 47%]
[2022-03-09T08:28:18.570Z] networkx/classes/tests/test_coreviews.py ............................... [ 48%]
[2022-03-09T08:28:18.570Z] .......................... [ 48%]
[2022-03-09T08:28:19.121Z] networkx/classes/tests/test_digraph.py ................................. [ 49%]
[2022-03-09T08:28:19.371Z] ............................................... [ 50%]
[2022-03-09T08:28:19.371Z] networkx/classes/tests/test_digraph_historical.py ...................... [ 50%]
[2022-03-09T08:28:19.371Z] .................... [ 51%]
[2022-03-09T08:28:19.371Z] networkx/classes/tests/test_filters.py ........... [ 51%]
[2022-03-09T08:28:19.371Z] networkx/classes/tests/test_function.py ................................ [ 52%]
[2022-03-09T08:28:19.371Z] .................................... [ 52%]
[2022-03-09T08:28:20.282Z] networkx/classes/tests/test_graph.py ................................... [ 53%]
[2022-03-09T08:28:20.282Z] ........................... [ 54%]
[2022-03-09T08:28:20.282Z] networkx/classes/tests/test_graph_historical.py ........................ [ 54%]
[2022-03-09T08:28:20.282Z] .......... [ 54%]
[2022-03-09T08:28:20.282Z] networkx/classes/tests/test_graphviews.py .............................. [ 55%]
[2022-03-09T08:28:20.282Z] ..... [ 55%]
[2022-03-09T08:28:21.193Z] networkx/classes/tests/test_multidigraph.py ............................ [ 56%]
[2022-03-09T08:28:21.193Z] ................................................................. [ 57%]
[2022-03-09T08:28:22.104Z] networkx/classes/tests/test_multigraph.py .............................. [ 58%]
[2022-03-09T08:28:22.104Z] ................................................ [ 59%]
[2022-03-09T08:28:22.104Z] networkx/classes/tests/test_ordered.py ..... [ 59%]
[2022-03-09T08:28:22.104Z] networkx/classes/tests/test_reportviews.py ............................. [ 59%]
[2022-03-09T08:28:22.354Z] ........................................................................ [ 61%]
[2022-03-09T08:28:22.354Z] ........................................................................ [ 62%]
[2022-03-09T08:28:22.605Z] ................................................................ [ 64%]
[2022-03-09T08:28:23.515Z] networkx/classes/tests/test_special.py ................................. [ 64%]
[2022-03-09T08:28:24.316Z] ........................................................................ [ 66%]
[2022-03-09T08:28:26.028Z] ........................................................................ [ 67%]
[2022-03-09T08:28:26.938Z] ........................................................................ [ 69%]
[2022-03-09T08:28:28.760Z] ........................................................................ [ 70%]
[2022-03-09T08:28:29.671Z] ........................................................................ [ 72%]
[2022-03-09T08:28:30.581Z] ........................................................................ [ 73%]
[2022-03-09T08:28:31.492Z] ........................................................................ [ 75%]
[2022-03-09T08:28:31.492Z] ........................................................................ [ 76%]
[2022-03-09T08:28:31.492Z] ... [ 76%]
[2022-03-09T08:28:31.492Z] networkx/classes/tests/test_subgraphviews.py ........................... [ 77%]
[2022-03-09T08:28:31.492Z] ..... [ 77%]
[2022-03-09T08:28:39.987Z] networkx/drawing/tests/test_layout.py ...FFF..F................. [ 77%]
[2022-03-09T08:28:39.987Z] networkx/drawing/tests/test_pydot.py XXX [ 77%]
[2022-03-09T08:28:40.487Z] networkx/drawing/tests/test_pylab.py F.................................. [ 78%]
[2022-03-09T08:28:41.488Z] ....................................................... [ 79%]
[2022-03-09T08:28:41.739Z] networkx/generators/tests/test_atlas.py ........ [ 79%]
[2022-03-09T08:28:41.739Z] networkx/generators/tests/test_classic.py .............................. [ 80%]
[2022-03-09T08:28:41.739Z] [ 80%]
[2022-03-09T08:28:41.739Z] networkx/generators/tests/test_cographs.py . [ 80%]
[2022-03-09T08:28:42.239Z] networkx/generators/tests/test_community.py ................ [ 80%]
[2022-03-09T08:28:42.490Z] networkx/generators/tests/test_degree_seq.py ................... [ 81%]
[2022-03-09T08:28:42.490Z] networkx/generators/tests/test_directed.py ........ [ 81%]
[2022-03-09T08:28:42.490Z] networkx/generators/tests/test_duplication.py ....... [ 81%]
[2022-03-09T08:28:42.490Z] networkx/generators/tests/test_ego.py .. [ 81%]
[2022-03-09T08:28:42.490Z] networkx/generators/tests/test_expanders.py .... [ 81%]
[2022-03-09T08:28:42.740Z] networkx/generators/tests/test_geometric.py ....................... [ 82%]
[2022-03-09T08:28:42.740Z] networkx/generators/tests/test_harary_graph.py .. [ 82%]
[2022-03-09T08:28:42.740Z] networkx/generators/tests/test_internet_as_graphs.py ..... [ 82%]
[2022-03-09T08:28:42.740Z] networkx/generators/tests/test_intersection.py .... [ 82%]
[2022-03-09T08:28:42.740Z] networkx/generators/tests/test_interval_graph.py ........ [ 82%]
[2022-03-09T08:28:44.601Z] networkx/generators/tests/test_joint_degree_seq.py .... [ 82%]
[2022-03-09T08:28:44.601Z] networkx/generators/tests/test_lattice.py ...................... [ 83%]
[2022-03-09T08:28:44.852Z] networkx/generators/tests/test_line.py ............................. [ 83%]
[2022-03-09T08:28:44.852Z] networkx/generators/tests/test_mycielski.py ... [ 83%]
[2022-03-09T08:28:44.852Z] networkx/generators/tests/test_nonisomorphic_trees.py ..... [ 83%]
[2022-03-09T08:28:44.852Z] networkx/generators/tests/test_random_clustered.py .... [ 83%]
[2022-03-09T08:28:44.852Z] networkx/generators/tests/test_random_graphs.py ........................ [ 84%]
[2022-03-09T08:28:47.905Z] ....................................... [ 85%]
[2022-03-09T08:28:47.905Z] networkx/generators/tests/test_small.py ................................ [ 85%]
[2022-03-09T08:28:47.905Z] ....... [ 85%]
[2022-03-09T08:28:48.156Z] networkx/generators/tests/test_spectral_graph_forge.py F [ 85%]
[2022-03-09T08:28:48.156Z] networkx/generators/tests/test_stochastic.py ...... [ 86%]
[2022-03-09T08:28:48.156Z] networkx/generators/tests/test_sudoku.py ...... [ 86%]
[2022-03-09T08:28:48.156Z] networkx/generators/tests/test_trees.py ....... [ 86%]
[2022-03-09T08:28:48.156Z] networkx/generators/tests/test_triads.py .. [ 86%]
[2022-03-09T08:28:48.156Z] networkx/linalg/tests/test_algebraic_connectivity.py ................... [ 86%]
[2022-03-09T08:28:48.656Z] .................................................................... [ 88%]
[2022-03-09T08:28:48.656Z] networkx/linalg/tests/test_attrmatrix.py ..... [ 88%]
[2022-03-09T08:28:48.656Z] networkx/linalg/tests/test_bethehessian.py . [ 88%]
[2022-03-09T08:28:48.656Z] networkx/linalg/tests/test_graphmatrix.py .... [ 88%]
[2022-03-09T08:28:48.657Z] networkx/linalg/tests/test_laplacian.py .... [ 88%]
[2022-03-09T08:28:48.907Z] networkx/linalg/tests/test_modularity.py ... [ 88%]
[2022-03-09T08:28:48.907Z] networkx/linalg/tests/test_spectrum.py ..... [ 88%]
[2022-03-09T08:28:48.907Z] networkx/readwrite/json_graph/tests/test_adjacency.py ...... [ 88%]
[2022-03-09T08:28:48.907Z] networkx/readwrite/json_graph/tests/test_cytoscape.py ........ [ 88%]
[2022-03-09T08:28:48.907Z] networkx/readwrite/json_graph/tests/test_jit.py ..... [ 89%]
[2022-03-09T08:28:48.907Z] networkx/readwrite/json_graph/tests/test_node_link.py ......... [ 89%]
[2022-03-09T08:28:48.907Z] networkx/readwrite/json_graph/tests/test_tree.py .... [ 89%]
[2022-03-09T08:28:48.907Z] networkx/readwrite/tests/test_adjlist.py .................. [ 89%]
[2022-03-09T08:28:48.907Z] networkx/readwrite/tests/test_edgelist.py .......................... [ 90%]
[2022-03-09T08:28:48.907Z] networkx/readwrite/tests/test_getattr_nxyaml_removal.py .... [ 90%]
[2022-03-09T08:28:48.907Z] networkx/readwrite/tests/test_gexf.py ..................... [ 90%]
[2022-03-09T08:28:48.907Z] networkx/readwrite/tests/test_gml.py ..................... [ 91%]
[2022-03-09T08:28:49.157Z] networkx/readwrite/tests/test_gpickle.py .. [ 91%]
[2022-03-09T08:28:49.157Z] networkx/readwrite/tests/test_graph6.py ............... [ 91%]
[2022-03-09T08:28:49.157Z] networkx/readwrite/tests/test_graphml.py ............................... [ 92%]
[2022-03-09T08:28:49.408Z] .............................. [ 92%]
[2022-03-09T08:28:49.408Z] networkx/readwrite/tests/test_leda.py .. [ 92%]
[2022-03-09T08:28:49.408Z] networkx/readwrite/tests/test_p2g.py ... [ 92%]
[2022-03-09T08:28:49.408Z] networkx/readwrite/tests/test_pajek.py ........ [ 93%]
[2022-03-09T08:28:49.959Z] networkx/readwrite/tests/test_sparse6.py ................ [ 93%]
[2022-03-09T08:28:49.959Z] networkx/readwrite/tests/test_text.py ....... [ 93%]
[2022-03-09T08:28:50.209Z] networkx/testing/tests/test_utils.py ..................... [ 93%]
[2022-03-09T08:28:50.209Z] networkx/tests/test_all_random_functions.py s [ 93%]
[2022-03-09T08:28:50.209Z] networkx/tests/test_convert.py ............... [ 94%]
[2022-03-09T08:28:50.209Z] networkx/tests/test_convert_numpy.py ................................... [ 94%]
[2022-03-09T08:28:50.209Z] ........................................ [ 95%]
[2022-03-09T08:28:50.459Z] networkx/tests/test_convert_pandas.py ...................... [ 96%]
[2022-03-09T08:28:50.710Z] networkx/tests/test_convert_scipy.py ..................... [ 96%]
[2022-03-09T08:28:50.710Z] networkx/tests/test_exceptions.py ....... [ 96%]
[2022-03-09T08:28:50.710Z] networkx/tests/test_import.py .. [ 96%]
[2022-03-09T08:28:50.710Z] networkx/tests/test_lazy_imports.py .... [ 96%]
[2022-03-09T08:28:50.710Z] networkx/tests/test_relabel.py ....................... [ 97%]
[2022-03-09T08:28:50.710Z] networkx/utils/tests/test__init.py . [ 97%]
[2022-03-09T08:28:50.710Z] networkx/utils/tests/test_contextmanager.py . [ 97%]
[2022-03-09T08:28:50.710Z] networkx/utils/tests/test_decorators.py ................................ [ 98%]
[2022-03-09T08:28:50.710Z] ... [ 98%]
[2022-03-09T08:28:50.710Z] networkx/utils/tests/test_heaps.py .. [ 98%]
[2022-03-09T08:28:50.710Z] networkx/utils/tests/test_mapped_queue.py .............................. [ 98%]
[2022-03-09T08:28:50.710Z] .......... [ 99%]
[2022-03-09T08:28:50.960Z] networkx/utils/tests/test_misc.py ..................................... [ 99%]
[2022-03-09T08:28:50.960Z] networkx/utils/tests/test_random_sequence.py .... [ 99%]
[2022-03-09T08:28:50.960Z] networkx/utils/tests/test_rcm.py .. [ 99%]
[2022-03-09T08:28:50.960Z] networkx/utils/tests/test_unionfind.py ..... [100%]
[2022-03-09T08:28:50.960Z]
[2022-03-09T08:28:50.960Z] =================================== FAILURES ===================================
[2022-03-09T08:28:50.961Z] ____________________________ test_held_karp_ascent _____________________________
[2022-03-09T08:28:50.961Z]
[2022-03-09T08:28:50.961Z] def test_held_karp_ascent():
[2022-03-09T08:28:50.961Z] """
[2022-03-09T08:28:50.961Z] Test the Held-Karp relaxation with the ascent method
[2022-03-09T08:28:50.961Z] """
[2022-03-09T08:28:50.961Z] import networkx.algorithms.approximation.traveling_salesman as tsp
[2022-03-09T08:28:50.961Z]
[2022-03-09T08:28:50.961Z] np = pytest.importorskip("numpy")
[2022-03-09T08:28:50.961Z] pytest.importorskip("scipy")
[2022-03-09T08:28:50.961Z]
[2022-03-09T08:28:50.961Z] # Adjacency matrix from page 1153 of the 1970 Held and Karp paper
[2022-03-09T08:28:50.961Z] # which have been edited to be directional, but also symmetric
[2022-03-09T08:28:50.961Z] G_array = np.array(
[2022-03-09T08:28:50.961Z] [
[2022-03-09T08:28:50.961Z] [0, 97, 60, 73, 17, 52],
[2022-03-09T08:28:50.961Z] [97, 0, 41, 52, 90, 30],
[2022-03-09T08:28:50.961Z] [60, 41, 0, 21, 35, 41],
[2022-03-09T08:28:50.961Z] [73, 52, 21, 0, 95, 46],
[2022-03-09T08:28:50.961Z] [17, 90, 35, 95, 0, 81],
[2022-03-09T08:28:50.961Z] [52, 30, 41, 46, 81, 0],
[2022-03-09T08:28:50.961Z] ]
[2022-03-09T08:28:50.961Z] )
[2022-03-09T08:28:50.961Z]
[2022-03-09T08:28:50.961Z] solution_edges = [(1, 3), (2, 4), (3, 2), (4, 0), (5, 1), (0, 5)]
[2022-03-09T08:28:50.961Z]
[2022-03-09T08:28:50.961Z] G = nx.from_numpy_array(G_array, create_using=nx.DiGraph)
[2022-03-09T08:28:50.961Z] > opt_hk, z_star = tsp.held_karp_ascent(G)
[2022-03-09T08:28:50.961Z]
[2022-03-09T08:28:50.961Z] networkx/algorithms/approximation/tests/test_traveling_salesman.py:410:
[2022-03-09T08:28:50.961Z] _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
[2022-03-09T08:28:50.961Z] networkx/algorithms/approximation/traveling_salesman.py:533: in held_karp_ascent
[2022-03-09T08:28:50.961Z] import scipy.optimize as optimize
[2022-03-09T08:28:50.961Z] /usr/lib/python3.10/site-packages/scipy/optimize/__init__.py:412: in <module>
[2022-03-09T08:28:50.961Z] from ._linprog import linprog, linprog_verbose_callback
[2022-03-09T08:28:50.961Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog.py:23: in <module>
[2022-03-09T08:28:50.961Z] from ._linprog_ip import _linprog_ip
[2022-03-09T08:28:50.961Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog_ip.py:27: in <module>
[2022-03-09T08:28:50.961Z] from ._linprog_util import _postsolve
[2022-03-09T08:28:50.961Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog_util.py:9: in <module>
[2022-03-09T08:28:50.961Z] from scipy.optimize._remove_redundancy import (
[2022-03-09T08:28:50.961Z] /usr/lib/python3.10/site-packages/scipy/optimize/_remove_redundancy.py:9: in <module>
[2022-03-09T08:28:50.961Z] from scipy.linalg.interpolative import interp_decomp
[2022-03-09T08:28:50.961Z] /usr/lib/python3.10/site-packages/scipy/linalg/interpolative.py:385: in <module>
[2022-03-09T08:28:50.961Z] import scipy.linalg._interpolative_backend as _backend
[2022-03-09T08:28:50.961Z] _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
[2022-03-09T08:28:50.961Z]
[2022-03-09T08:28:50.961Z] #******************************************************************************
[2022-03-09T08:28:50.961Z] # Copyright (C) 2013 Kenneth L. Ho
[2022-03-09T08:28:50.961Z] #
[2022-03-09T08:28:50.961Z] # Redistribution and use in source and binary forms, with or without
[2022-03-09T08:28:50.961Z] # modification, are permitted provided that the following conditions are met:
[2022-03-09T08:28:50.961Z] #
[2022-03-09T08:28:50.961Z] # Redistributions of source code must retain the above copyright notice, this
[2022-03-09T08:28:50.961Z] # list of conditions and the following disclaimer. Redistributions in binary
[2022-03-09T08:28:50.961Z] # form must reproduce the above copyright notice, this list of conditions and
[2022-03-09T08:28:50.961Z] # the following disclaimer in the documentation and/or other materials
[2022-03-09T08:28:50.961Z] # provided with the distribution.
[2022-03-09T08:28:50.961Z] #
[2022-03-09T08:28:50.961Z] # None of the names of the copyright holders may be used to endorse or
[2022-03-09T08:28:50.961Z] # promote products derived from this software without specific prior written
[2022-03-09T08:28:50.961Z] # permission.
[2022-03-09T08:28:50.961Z] #
[2022-03-09T08:28:50.961Z] # THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
[2022-03-09T08:28:50.961Z] # AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
[2022-03-09T08:28:50.961Z] # IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
[2022-03-09T08:28:50.961Z] # ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
[2022-03-09T08:28:50.961Z] # LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
[2022-03-09T08:28:50.961Z] # CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
[2022-03-09T08:28:50.961Z] # SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
[2022-03-09T08:28:50.961Z] # INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
[2022-03-09T08:28:50.961Z] # CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
[2022-03-09T08:28:50.961Z] # ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
[2022-03-09T08:28:50.961Z] # POSSIBILITY OF SUCH DAMAGE.
[2022-03-09T08:28:50.961Z] #******************************************************************************
[2022-03-09T08:28:50.961Z]
[2022-03-09T08:28:50.961Z] """
[2022-03-09T08:28:50.961Z] Direct wrappers for Fortran `id_dist` backend.
[2022-03-09T08:28:50.961Z] """
[2022-03-09T08:28:50.962Z]
[2022-03-09T08:28:50.962Z] > import scipy.linalg._interpolative as _id
[2022-03-09T08:28:50.962Z] E ImportError: /usr/lib/python3.10/site-packages/scipy/linalg/_interpolative.cpython-310-x86_64-linux-gnu.so: undefined symbol: _ZGVbN2v_sin
[2022-03-09T08:28:50.962Z]
[2022-03-09T08:28:50.962Z] /usr/lib/python3.10/site-packages/scipy/linalg/_interpolative_backend.py:34: ImportError
[2022-03-09T08:28:50.962Z] _______________________ test_ascent_fractional_solution ________________________
[2022-03-09T08:28:50.962Z]
[2022-03-09T08:28:50.962Z] def test_ascent_fractional_solution():
[2022-03-09T08:28:50.962Z] """
[2022-03-09T08:28:50.962Z] Test the ascent method using a modified version of Figure 2 on page 1140
[2022-03-09T08:28:50.962Z] in 'The Traveling Salesman Problem and Minimum Spanning Trees' by Held and
[2022-03-09T08:28:50.962Z] Karp
[2022-03-09T08:28:50.962Z] """
[2022-03-09T08:28:50.962Z] import networkx.algorithms.approximation.traveling_salesman as tsp
[2022-03-09T08:28:50.962Z]
[2022-03-09T08:28:50.962Z] np = pytest.importorskip("numpy")
[2022-03-09T08:28:50.962Z] pytest.importorskip("scipy")
[2022-03-09T08:28:50.962Z]
[2022-03-09T08:28:50.962Z] # This version of Figure 2 has all of the edge weights multiplied by 100
[2022-03-09T08:28:50.962Z] # and is a complete directed graph with infinite edge weights for the
[2022-03-09T08:28:50.962Z] # edges not listed in the original graph
[2022-03-09T08:28:50.962Z] G_array = np.array(
[2022-03-09T08:28:50.962Z] [
[2022-03-09T08:28:50.962Z] [0, 100, 100, 100000, 100000, 1],
[2022-03-09T08:28:50.962Z] [100, 0, 100, 100000, 1, 100000],
[2022-03-09T08:28:50.962Z] [100, 100, 0, 1, 100000, 100000],
[2022-03-09T08:28:50.962Z] [100000, 100000, 1, 0, 100, 100],
[2022-03-09T08:28:50.962Z] [100000, 1, 100000, 100, 0, 100],
[2022-03-09T08:28:50.962Z] [1, 100000, 100000, 100, 100, 0],
[2022-03-09T08:28:50.962Z] ]
[2022-03-09T08:28:50.962Z] )
[2022-03-09T08:28:50.962Z]
[2022-03-09T08:28:50.962Z] solution_z_star = {
[2022-03-09T08:28:50.962Z] (0, 1): 5 / 12,
[2022-03-09T08:28:50.962Z] (0, 2): 5 / 12,
[2022-03-09T08:28:50.962Z] (0, 5): 5 / 6,
[2022-03-09T08:28:50.962Z] (1, 0): 5 / 12,
[2022-03-09T08:28:50.962Z] (1, 2): 1 / 3,
[2022-03-09T08:28:50.962Z] (1, 4): 5 / 6,
[2022-03-09T08:28:50.962Z] (2, 0): 5 / 12,
[2022-03-09T08:28:50.962Z] (2, 1): 1 / 3,
[2022-03-09T08:28:50.962Z] (2, 3): 5 / 6,
[2022-03-09T08:28:50.962Z] (3, 2): 5 / 6,
[2022-03-09T08:28:50.962Z] (3, 4): 1 / 3,
[2022-03-09T08:28:50.962Z] (3, 5): 1 / 2,
[2022-03-09T08:28:50.962Z] (4, 1): 5 / 6,
[2022-03-09T08:28:50.962Z] (4, 3): 1 / 3,
[2022-03-09T08:28:50.962Z] (4, 5): 1 / 2,
[2022-03-09T08:28:50.962Z] (5, 0): 5 / 6,
[2022-03-09T08:28:50.962Z] (5, 3): 1 / 2,
[2022-03-09T08:28:50.962Z] (5, 4): 1 / 2,
[2022-03-09T08:28:50.962Z] }
[2022-03-09T08:28:50.962Z]
[2022-03-09T08:28:50.962Z] G = nx.from_numpy_array(G_array, create_using=nx.DiGraph)
[2022-03-09T08:28:50.962Z] > opt_hk, z_star = tsp.held_karp_ascent(G)
[2022-03-09T08:28:50.962Z]
[2022-03-09T08:28:50.962Z] networkx/algorithms/approximation/tests/test_traveling_salesman.py:467:
[2022-03-09T08:28:50.962Z] _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
[2022-03-09T08:28:50.962Z] networkx/algorithms/approximation/traveling_salesman.py:533: in held_karp_ascent
[2022-03-09T08:28:50.962Z] import scipy.optimize as optimize
[2022-03-09T08:28:50.962Z] /usr/lib/python3.10/site-packages/scipy/optimize/__init__.py:412: in <module>
[2022-03-09T08:28:50.962Z] from ._linprog import linprog, linprog_verbose_callback
[2022-03-09T08:28:50.962Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog.py:23: in <module>
[2022-03-09T08:28:50.962Z] from ._linprog_ip import _linprog_ip
[2022-03-09T08:28:50.962Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog_ip.py:27: in <module>
[2022-03-09T08:28:50.962Z] from ._linprog_util import _postsolve
[2022-03-09T08:28:50.962Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog_util.py:9: in <module>
[2022-03-09T08:28:50.962Z] from scipy.optimize._remove_redundancy import (
[2022-03-09T08:28:50.962Z] /usr/lib/python3.10/site-packages/scipy/optimize/_remove_redundancy.py:9: in <module>
[2022-03-09T08:28:50.962Z] from scipy.linalg.interpolative import interp_decomp
[2022-03-09T08:28:50.962Z] /usr/lib/python3.10/site-packages/scipy/linalg/interpolative.py:385: in <module>
[2022-03-09T08:28:50.962Z] import scipy.linalg._interpolative_backend as _backend
[2022-03-09T08:28:50.962Z] _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
[2022-03-09T08:28:50.962Z]
[2022-03-09T08:28:50.962Z] #******************************************************************************
[2022-03-09T08:28:50.962Z] # Copyright (C) 2013 Kenneth L. Ho
[2022-03-09T08:28:50.962Z] #
[2022-03-09T08:28:50.962Z] # Redistribution and use in source and binary forms, with or without
[2022-03-09T08:28:50.962Z] # modification, are permitted provided that the following conditions are met:
[2022-03-09T08:28:50.962Z] #
[2022-03-09T08:28:50.962Z] # Redistributions of source code must retain the above copyright notice, this
[2022-03-09T08:28:50.962Z] # list of conditions and the following disclaimer. Redistributions in binary
[2022-03-09T08:28:50.962Z] # form must reproduce the above copyright notice, this list of conditions and
[2022-03-09T08:28:50.962Z] # the following disclaimer in the documentation and/or other materials
[2022-03-09T08:28:50.962Z] # provided with the distribution.
[2022-03-09T08:28:50.962Z] #
[2022-03-09T08:28:50.962Z] # None of the names of the copyright holders may be used to endorse or
[2022-03-09T08:28:50.963Z] # promote products derived from this software without specific prior written
[2022-03-09T08:28:50.963Z] # permission.
[2022-03-09T08:28:50.963Z] #
[2022-03-09T08:28:50.963Z] # THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
[2022-03-09T08:28:50.963Z] # AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
[2022-03-09T08:28:50.963Z] # IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
[2022-03-09T08:28:50.963Z] # ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
[2022-03-09T08:28:50.963Z] # LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
[2022-03-09T08:28:50.963Z] # CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
[2022-03-09T08:28:50.963Z] # SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
[2022-03-09T08:28:50.963Z] # INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
[2022-03-09T08:28:50.963Z] # CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
[2022-03-09T08:28:50.963Z] # ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
[2022-03-09T08:28:50.963Z] # POSSIBILITY OF SUCH DAMAGE.
[2022-03-09T08:28:50.963Z] #******************************************************************************
[2022-03-09T08:28:50.963Z]
[2022-03-09T08:28:50.963Z] """
[2022-03-09T08:28:50.963Z] Direct wrappers for Fortran `id_dist` backend.
[2022-03-09T08:28:50.963Z] """
[2022-03-09T08:28:50.963Z]
[2022-03-09T08:28:50.963Z] > import scipy.linalg._interpolative as _id
[2022-03-09T08:28:50.963Z] E ImportError: /usr/lib/python3.10/site-packages/scipy/linalg/_interpolative.cpython-310-x86_64-linux-gnu.so: undefined symbol: _ZGVbN2v_sin
[2022-03-09T08:28:50.963Z]
[2022-03-09T08:28:50.963Z] /usr/lib/python3.10/site-packages/scipy/linalg/_interpolative_backend.py:34: ImportError
[2022-03-09T08:28:50.963Z] ________________________ test_ascent_method_asymmetric _________________________
[2022-03-09T08:28:50.963Z]
[2022-03-09T08:28:50.963Z] def test_ascent_method_asymmetric():
[2022-03-09T08:28:50.963Z] """
[2022-03-09T08:28:50.963Z] Tests the ascent method using a truly asymmetric graph for which the
[2022-03-09T08:28:50.963Z] solution has been brute forced
[2022-03-09T08:28:50.963Z] """
[2022-03-09T08:28:50.963Z] import networkx.algorithms.approximation.traveling_salesman as tsp
[2022-03-09T08:28:50.963Z]
[2022-03-09T08:28:50.963Z] np = pytest.importorskip("numpy")
[2022-03-09T08:28:50.963Z] pytest.importorskip("scipy")
[2022-03-09T08:28:50.963Z]
[2022-03-09T08:28:50.963Z] G_array = np.array(
[2022-03-09T08:28:50.963Z] [
[2022-03-09T08:28:50.963Z] [0, 26, 63, 59, 69, 31, 41],
[2022-03-09T08:28:50.963Z] [62, 0, 91, 53, 75, 87, 47],
[2022-03-09T08:28:50.963Z] [47, 82, 0, 90, 15, 9, 18],
[2022-03-09T08:28:50.963Z] [68, 19, 5, 0, 58, 34, 93],
[2022-03-09T08:28:50.963Z] [11, 58, 53, 55, 0, 61, 79],
[2022-03-09T08:28:50.963Z] [88, 75, 13, 76, 98, 0, 40],
[2022-03-09T08:28:50.963Z] [41, 61, 55, 88, 46, 45, 0],
[2022-03-09T08:28:50.963Z] ]
[2022-03-09T08:28:50.963Z] )
[2022-03-09T08:28:50.963Z]
[2022-03-09T08:28:50.963Z] solution_edges = [(0, 1), (1, 3), (3, 2), (2, 5), (5, 6), (4, 0), (6, 4)]
[2022-03-09T08:28:50.963Z]
[2022-03-09T08:28:50.963Z] G = nx.from_numpy_array(G_array, create_using=nx.DiGraph)
[2022-03-09T08:28:50.963Z] > opt_hk, z_star = tsp.held_karp_ascent(G)
[2022-03-09T08:28:50.963Z]
[2022-03-09T08:28:50.963Z] networkx/algorithms/approximation/tests/test_traveling_salesman.py:502:
[2022-03-09T08:28:50.963Z] _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
[2022-03-09T08:28:50.963Z] networkx/algorithms/approximation/traveling_salesman.py:533: in held_karp_ascent
[2022-03-09T08:28:50.963Z] import scipy.optimize as optimize
[2022-03-09T08:28:50.963Z] /usr/lib/python3.10/site-packages/scipy/optimize/__init__.py:412: in <module>
[2022-03-09T08:28:50.963Z] from ._linprog import linprog, linprog_verbose_callback
[2022-03-09T08:28:50.963Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog.py:23: in <module>
[2022-03-09T08:28:50.963Z] from ._linprog_ip import _linprog_ip
[2022-03-09T08:28:50.963Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog_ip.py:27: in <module>
[2022-03-09T08:28:50.963Z] from ._linprog_util import _postsolve
[2022-03-09T08:28:50.963Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog_util.py:9: in <module>
[2022-03-09T08:28:50.963Z] from scipy.optimize._remove_redundancy import (
[2022-03-09T08:28:50.963Z] /usr/lib/python3.10/site-packages/scipy/optimize/_remove_redundancy.py:9: in <module>
[2022-03-09T08:28:50.963Z] from scipy.linalg.interpolative import interp_decomp
[2022-03-09T08:28:50.963Z] /usr/lib/python3.10/site-packages/scipy/linalg/interpolative.py:385: in <module>
[2022-03-09T08:28:50.963Z] import scipy.linalg._interpolative_backend as _backend
[2022-03-09T08:28:50.963Z] _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
[2022-03-09T08:28:50.963Z]
[2022-03-09T08:28:50.963Z] #******************************************************************************
[2022-03-09T08:28:50.963Z] # Copyright (C) 2013 Kenneth L. Ho
[2022-03-09T08:28:50.963Z] #
[2022-03-09T08:28:50.963Z] # Redistribution and use in source and binary forms, with or without
[2022-03-09T08:28:50.963Z] # modification, are permitted provided that the following conditions are met:
[2022-03-09T08:28:50.963Z] #
[2022-03-09T08:28:50.963Z] # Redistributions of source code must retain the above copyright notice, this
[2022-03-09T08:28:50.964Z] # list of conditions and the following disclaimer. Redistributions in binary
[2022-03-09T08:28:50.964Z] # form must reproduce the above copyright notice, this list of conditions and
[2022-03-09T08:28:50.964Z] # the following disclaimer in the documentation and/or other materials
[2022-03-09T08:28:50.964Z] # provided with the distribution.
[2022-03-09T08:28:50.964Z] #
[2022-03-09T08:28:50.964Z] # None of the names of the copyright holders may be used to endorse or
[2022-03-09T08:28:50.964Z] # promote products derived from this software without specific prior written
[2022-03-09T08:28:50.964Z] # permission.
[2022-03-09T08:28:50.964Z] #
[2022-03-09T08:28:50.964Z] # THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
[2022-03-09T08:28:50.964Z] # AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
[2022-03-09T08:28:50.964Z] # IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
[2022-03-09T08:28:50.964Z] # ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
[2022-03-09T08:28:50.964Z] # LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
[2022-03-09T08:28:50.964Z] # CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
[2022-03-09T08:28:50.964Z] # SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
[2022-03-09T08:28:50.964Z] # INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
[2022-03-09T08:28:50.964Z] # CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
[2022-03-09T08:28:50.964Z] # ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
[2022-03-09T08:28:50.964Z] # POSSIBILITY OF SUCH DAMAGE.
[2022-03-09T08:28:50.964Z] #******************************************************************************
[2022-03-09T08:28:50.964Z]
[2022-03-09T08:28:50.964Z] """
[2022-03-09T08:28:50.964Z] Direct wrappers for Fortran `id_dist` backend.
[2022-03-09T08:28:50.964Z] """
[2022-03-09T08:28:50.964Z]
[2022-03-09T08:28:50.964Z] > import scipy.linalg._interpolative as _id
[2022-03-09T08:28:50.964Z] E ImportError: /usr/lib/python3.10/site-packages/scipy/linalg/_interpolative.cpython-310-x86_64-linux-gnu.so: undefined symbol: _ZGVbN2v_sin
[2022-03-09T08:28:50.964Z]
[2022-03-09T08:28:50.964Z] /usr/lib/python3.10/site-packages/scipy/linalg/_interpolative_backend.py:34: ImportError
[2022-03-09T08:28:50.964Z] _______________________ test_ascent_method_asymmetric_2 ________________________
[2022-03-09T08:28:50.964Z]
[2022-03-09T08:28:50.964Z] def test_ascent_method_asymmetric_2():
[2022-03-09T08:28:50.964Z] """
[2022-03-09T08:28:50.964Z] Tests the ascent method using a truly asymmetric graph for which the
[2022-03-09T08:28:50.964Z] solution has been brute forced
[2022-03-09T08:28:50.964Z] """
[2022-03-09T08:28:50.964Z] import networkx.algorithms.approximation.traveling_salesman as tsp
[2022-03-09T08:28:50.964Z]
[2022-03-09T08:28:50.964Z] np = pytest.importorskip("numpy")
[2022-03-09T08:28:50.964Z] pytest.importorskip("scipy")
[2022-03-09T08:28:50.964Z]
[2022-03-09T08:28:50.964Z] G_array = np.array(
[2022-03-09T08:28:50.964Z] [
[2022-03-09T08:28:50.964Z] [0, 45, 39, 92, 29, 31],
[2022-03-09T08:28:50.964Z] [72, 0, 4, 12, 21, 60],
[2022-03-09T08:28:50.964Z] [81, 6, 0, 98, 70, 53],
[2022-03-09T08:28:50.964Z] [49, 71, 59, 0, 98, 94],
[2022-03-09T08:28:50.964Z] [74, 95, 24, 43, 0, 47],
[2022-03-09T08:28:50.964Z] [56, 43, 3, 65, 22, 0],
[2022-03-09T08:28:50.964Z] ]
[2022-03-09T08:28:50.964Z] )
[2022-03-09T08:28:50.964Z]
[2022-03-09T08:28:50.964Z] solution_edges = [(0, 5), (5, 4), (1, 3), (3, 0), (2, 1), (4, 2)]
[2022-03-09T08:28:50.964Z]
[2022-03-09T08:28:50.964Z] G = nx.from_numpy_array(G_array, create_using=nx.DiGraph)
[2022-03-09T08:28:50.964Z] > opt_hk, z_star = tsp.held_karp_ascent(G)
[2022-03-09T08:28:50.964Z]
[2022-03-09T08:28:50.964Z] networkx/algorithms/approximation/tests/test_traveling_salesman.py:536:
[2022-03-09T08:28:50.964Z] _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
[2022-03-09T08:28:50.964Z] networkx/algorithms/approximation/traveling_salesman.py:533: in held_karp_ascent
[2022-03-09T08:28:50.964Z] import scipy.optimize as optimize
[2022-03-09T08:28:50.964Z] /usr/lib/python3.10/site-packages/scipy/optimize/__init__.py:412: in <module>
[2022-03-09T08:28:50.964Z] from ._linprog import linprog, linprog_verbose_callback
[2022-03-09T08:28:50.964Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog.py:23: in <module>
[2022-03-09T08:28:50.964Z] from ._linprog_ip import _linprog_ip
[2022-03-09T08:28:50.964Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog_ip.py:27: in <module>
[2022-03-09T08:28:50.964Z] from ._linprog_util import _postsolve
[2022-03-09T08:28:50.964Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog_util.py:9: in <module>
[2022-03-09T08:28:50.964Z] from scipy.optimize._remove_redundancy import (
[2022-03-09T08:28:50.964Z] /usr/lib/python3.10/site-packages/scipy/optimize/_remove_redundancy.py:9: in <module>
[2022-03-09T08:28:50.964Z] from scipy.linalg.interpolative import interp_decomp
[2022-03-09T08:28:50.964Z] /usr/lib/python3.10/site-packages/scipy/linalg/interpolative.py:385: in <module>
[2022-03-09T08:28:50.964Z] import scipy.linalg._interpolative_backend as _backend
[2022-03-09T08:28:50.964Z] _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
[2022-03-09T08:28:50.964Z]
[2022-03-09T08:28:50.964Z] #******************************************************************************
[2022-03-09T08:28:50.964Z] # Copyright (C) 2013 Kenneth L. Ho
[2022-03-09T08:28:50.964Z] #
[2022-03-09T08:28:50.964Z] # Redistribution and use in source and binary forms, with or without
[2022-03-09T08:28:50.964Z] # modification, are permitted provided that the following conditions are met:
[2022-03-09T08:28:50.964Z] #
[2022-03-09T08:28:50.965Z] # Redistributions of source code must retain the above copyright notice, this
[2022-03-09T08:28:50.965Z] # list of conditions and the following disclaimer. Redistributions in binary
[2022-03-09T08:28:51.215Z] # form must reproduce the above copyright notice, this list of conditions and
[2022-03-09T08:28:51.215Z] # the following disclaimer in the documentation and/or other materials
[2022-03-09T08:28:51.215Z] # provided with the distribution.
[2022-03-09T08:28:51.215Z] #
[2022-03-09T08:28:51.215Z] # None of the names of the copyright holders may be used to endorse or
[2022-03-09T08:28:51.215Z] # promote products derived from this software without specific prior written
[2022-03-09T08:28:51.215Z] # permission.
[2022-03-09T08:28:51.215Z] #
[2022-03-09T08:28:51.215Z] # THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
[2022-03-09T08:28:51.215Z] # AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
[2022-03-09T08:28:51.215Z] # IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
[2022-03-09T08:28:51.215Z] # ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
[2022-03-09T08:28:51.215Z] # LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
[2022-03-09T08:28:51.215Z] # CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
[2022-03-09T08:28:51.215Z] # SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
[2022-03-09T08:28:51.215Z] # INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
[2022-03-09T08:28:51.215Z] # CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
[2022-03-09T08:28:51.215Z] # ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
[2022-03-09T08:28:51.215Z] # POSSIBILITY OF SUCH DAMAGE.
[2022-03-09T08:28:51.216Z] #******************************************************************************
[2022-03-09T08:28:51.216Z]
[2022-03-09T08:28:51.216Z] """
[2022-03-09T08:28:51.216Z] Direct wrappers for Fortran `id_dist` backend.
[2022-03-09T08:28:51.216Z] """
[2022-03-09T08:28:51.216Z]
[2022-03-09T08:28:51.216Z] > import scipy.linalg._interpolative as _id
[2022-03-09T08:28:51.216Z] E ImportError: /usr/lib/python3.10/site-packages/scipy/linalg/_interpolative.cpython-310-x86_64-linux-gnu.so: undefined symbol: _ZGVbN2v_sin
[2022-03-09T08:28:51.216Z]
[2022-03-09T08:28:51.216Z] /usr/lib/python3.10/site-packages/scipy/linalg/_interpolative_backend.py:34: ImportError
[2022-03-09T08:28:51.216Z] ______________________ test_held_karp_ascent_asymmetric_3 ______________________
[2022-03-09T08:28:51.216Z]
[2022-03-09T08:28:51.216Z] def test_held_karp_ascent_asymmetric_3():
[2022-03-09T08:28:51.216Z] """
[2022-03-09T08:28:51.216Z] Tests the ascent method using a truly asymmetric graph with a fractional
[2022-03-09T08:28:51.216Z] solution for which the solution has been brute forced.
[2022-03-09T08:28:51.216Z]
[2022-03-09T08:28:51.216Z] In this graph their are two different optimal, integral solutions (which
[2022-03-09T08:28:51.216Z] are also the overall atsp solutions) to the Held Karp relaxation. However,
[2022-03-09T08:28:51.216Z] this particular graph has two different tours of optimal value and the
[2022-03-09T08:28:51.216Z] possible solutions in the held_karp_ascent function are not stored in an
[2022-03-09T08:28:51.216Z] ordered data structure.
[2022-03-09T08:28:51.216Z] """
[2022-03-09T08:28:51.216Z] import networkx.algorithms.approximation.traveling_salesman as tsp
[2022-03-09T08:28:51.216Z]
[2022-03-09T08:28:51.216Z] np = pytest.importorskip("numpy")
[2022-03-09T08:28:51.216Z] pytest.importorskip("scipy")
[2022-03-09T08:28:51.216Z]
[2022-03-09T08:28:51.216Z] G_array = np.array(
[2022-03-09T08:28:51.216Z] [
[2022-03-09T08:28:51.216Z] [0, 1, 5, 2, 7, 4],
[2022-03-09T08:28:51.216Z] [7, 0, 7, 7, 1, 4],
[2022-03-09T08:28:51.216Z] [4, 7, 0, 9, 2, 1],
[2022-03-09T08:28:51.216Z] [7, 2, 7, 0, 4, 4],
[2022-03-09T08:28:51.216Z] [5, 5, 4, 4, 0, 3],
[2022-03-09T08:28:51.216Z] [3, 9, 1, 3, 4, 0],
[2022-03-09T08:28:51.216Z] ]
[2022-03-09T08:28:51.216Z] )
[2022-03-09T08:28:51.216Z]
[2022-03-09T08:28:51.216Z] solution1_edges = [(0, 3), (1, 4), (2, 5), (3, 1), (4, 2), (5, 0)]
[2022-03-09T08:28:51.216Z]
[2022-03-09T08:28:51.216Z] solution2_edges = [(0, 3), (3, 1), (1, 4), (4, 5), (2, 0), (5, 2)]
[2022-03-09T08:28:51.216Z]
[2022-03-09T08:28:51.216Z] G = nx.from_numpy_array(G_array, create_using=nx.DiGraph)
[2022-03-09T08:28:51.216Z] > opt_hk, z_star = tsp.held_karp_ascent(G)
[2022-03-09T08:28:51.216Z]
[2022-03-09T08:28:51.216Z] networkx/algorithms/approximation/tests/test_traveling_salesman.py:578:
[2022-03-09T08:28:51.216Z] _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
[2022-03-09T08:28:51.216Z] networkx/algorithms/approximation/traveling_salesman.py:533: in held_karp_ascent
[2022-03-09T08:28:51.216Z] import scipy.optimize as optimize
[2022-03-09T08:28:51.216Z] /usr/lib/python3.10/site-packages/scipy/optimize/__init__.py:412: in <module>
[2022-03-09T08:28:51.216Z] from ._linprog import linprog, linprog_verbose_callback
[2022-03-09T08:28:51.216Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog.py:23: in <module>
[2022-03-09T08:28:51.216Z] from ._linprog_ip import _linprog_ip
[2022-03-09T08:28:51.216Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog_ip.py:27: in <module>
[2022-03-09T08:28:51.216Z] from ._linprog_util import _postsolve
[2022-03-09T08:28:51.216Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog_util.py:9: in <module>
[2022-03-09T08:28:51.216Z] from scipy.optimize._remove_redundancy import (
[2022-03-09T08:28:51.216Z] /usr/lib/python3.10/site-packages/scipy/optimize/_remove_redundancy.py:9: in <module>
[2022-03-09T08:28:51.216Z] from scipy.linalg.interpolative import interp_decomp
[2022-03-09T08:28:51.216Z] /usr/lib/python3.10/site-packages/scipy/linalg/interpolative.py:385: in <module>
[2022-03-09T08:28:51.216Z] import scipy.linalg._interpolative_backend as _backend
[2022-03-09T08:28:51.216Z] _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
[2022-03-09T08:28:51.216Z]
[2022-03-09T08:28:51.216Z] #******************************************************************************
[2022-03-09T08:28:51.216Z] # Copyright (C) 2013 Kenneth L. Ho
[2022-03-09T08:28:51.216Z] #
[2022-03-09T08:28:51.216Z] # Redistribution and use in source and binary forms, with or without
[2022-03-09T08:28:51.216Z] # modification, are permitted provided that the following conditions are met:
[2022-03-09T08:28:51.216Z] #
[2022-03-09T08:28:51.216Z] # Redistributions of source code must retain the above copyright notice, this
[2022-03-09T08:28:51.216Z] # list of conditions and the following disclaimer. Redistributions in binary
[2022-03-09T08:28:51.216Z] # form must reproduce the above copyright notice, this list of conditions and
[2022-03-09T08:28:51.216Z] # the following disclaimer in the documentation and/or other materials
[2022-03-09T08:28:51.216Z] # provided with the distribution.
[2022-03-09T08:28:51.216Z] #
[2022-03-09T08:28:51.216Z] # None of the names of the copyright holders may be used to endorse or
[2022-03-09T08:28:51.216Z] # promote products derived from this software without specific prior written
[2022-03-09T08:28:51.216Z] # permission.
[2022-03-09T08:28:51.216Z] #
[2022-03-09T08:28:51.216Z] # THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
[2022-03-09T08:28:51.217Z] # AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
[2022-03-09T08:28:51.217Z] # IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
[2022-03-09T08:28:51.217Z] # ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
[2022-03-09T08:28:51.217Z] # LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
[2022-03-09T08:28:51.217Z] # CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
[2022-03-09T08:28:51.217Z] # SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
[2022-03-09T08:28:51.217Z] # INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
[2022-03-09T08:28:51.217Z] # CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
[2022-03-09T08:28:51.217Z] # ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
[2022-03-09T08:28:51.217Z] # POSSIBILITY OF SUCH DAMAGE.
[2022-03-09T08:28:51.217Z] #******************************************************************************
[2022-03-09T08:28:51.217Z]
[2022-03-09T08:28:51.217Z] """
[2022-03-09T08:28:51.217Z] Direct wrappers for Fortran `id_dist` backend.
[2022-03-09T08:28:51.217Z] """
[2022-03-09T08:28:51.217Z]
[2022-03-09T08:28:51.217Z] > import scipy.linalg._interpolative as _id
[2022-03-09T08:28:51.217Z] E ImportError: /usr/lib/python3.10/site-packages/scipy/linalg/_interpolative.cpython-310-x86_64-linux-gnu.so: undefined symbol: _ZGVbN2v_sin
[2022-03-09T08:28:51.217Z]
[2022-03-09T08:28:51.217Z] /usr/lib/python3.10/site-packages/scipy/linalg/_interpolative_backend.py:34: ImportError
[2022-03-09T08:28:51.217Z] _________________ test_held_karp_ascent_fractional_asymmetric __________________
[2022-03-09T08:28:51.217Z]
[2022-03-09T08:28:51.217Z] def test_held_karp_ascent_fractional_asymmetric():
[2022-03-09T08:28:51.217Z] """
[2022-03-09T08:28:51.217Z] Tests the ascent method using a truly asymmetric graph with a fractional
[2022-03-09T08:28:51.217Z] solution for which the solution has been brute forced
[2022-03-09T08:28:51.217Z] """
[2022-03-09T08:28:51.217Z] import networkx.algorithms.approximation.traveling_salesman as tsp
[2022-03-09T08:28:51.217Z]
[2022-03-09T08:28:51.217Z] np = pytest.importorskip("numpy")
[2022-03-09T08:28:51.217Z] pytest.importorskip("scipy")
[2022-03-09T08:28:51.217Z]
[2022-03-09T08:28:51.217Z] G_array = np.array(
[2022-03-09T08:28:51.217Z] [
[2022-03-09T08:28:51.217Z] [0, 100, 150, 100000, 100000, 1],
[2022-03-09T08:28:51.217Z] [150, 0, 100, 100000, 1, 100000],
[2022-03-09T08:28:51.217Z] [100, 150, 0, 1, 100000, 100000],
[2022-03-09T08:28:51.217Z] [100000, 100000, 1, 0, 150, 100],
[2022-03-09T08:28:51.217Z] [100000, 2, 100000, 100, 0, 150],
[2022-03-09T08:28:51.217Z] [2, 100000, 100000, 150, 100, 0],
[2022-03-09T08:28:51.217Z] ]
[2022-03-09T08:28:51.217Z] )
[2022-03-09T08:28:51.217Z]
[2022-03-09T08:28:51.217Z] solution_z_star = {
[2022-03-09T08:28:51.217Z] (0, 1): 5 / 12,
[2022-03-09T08:28:51.217Z] (0, 2): 5 / 12,
[2022-03-09T08:28:51.217Z] (0, 5): 5 / 6,
[2022-03-09T08:28:51.217Z] (1, 0): 5 / 12,
[2022-03-09T08:28:51.217Z] (1, 2): 5 / 12,
[2022-03-09T08:28:51.217Z] (1, 4): 5 / 6,
[2022-03-09T08:28:51.217Z] (2, 0): 5 / 12,
[2022-03-09T08:28:51.217Z] (2, 1): 5 / 12,
[2022-03-09T08:28:51.217Z] (2, 3): 5 / 6,
[2022-03-09T08:28:51.217Z] (3, 2): 5 / 6,
[2022-03-09T08:28:51.217Z] (3, 4): 5 / 12,
[2022-03-09T08:28:51.217Z] (3, 5): 5 / 12,
[2022-03-09T08:28:51.217Z] (4, 1): 5 / 6,
[2022-03-09T08:28:51.217Z] (4, 3): 5 / 12,
[2022-03-09T08:28:51.217Z] (4, 5): 5 / 12,
[2022-03-09T08:28:51.217Z] (5, 0): 5 / 6,
[2022-03-09T08:28:51.217Z] (5, 3): 5 / 12,
[2022-03-09T08:28:51.217Z] (5, 4): 5 / 12,
[2022-03-09T08:28:51.217Z] }
[2022-03-09T08:28:51.217Z]
[2022-03-09T08:28:51.217Z] G = nx.from_numpy_array(G_array, create_using=nx.DiGraph)
[2022-03-09T08:28:51.217Z] > opt_hk, z_star = tsp.held_karp_ascent(G)
[2022-03-09T08:28:51.217Z]
[2022-03-09T08:28:51.217Z] networkx/algorithms/approximation/tests/test_traveling_salesman.py:634:
[2022-03-09T08:28:51.217Z] _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
[2022-03-09T08:28:51.217Z] networkx/algorithms/approximation/traveling_salesman.py:533: in held_karp_ascent
[2022-03-09T08:28:51.217Z] import scipy.optimize as optimize
[2022-03-09T08:28:51.217Z] /usr/lib/python3.10/site-packages/scipy/optimize/__init__.py:412: in <module>
[2022-03-09T08:28:51.217Z] from ._linprog import linprog, linprog_verbose_callback
[2022-03-09T08:28:51.217Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog.py:23: in <module>
[2022-03-09T08:28:51.217Z] from ._linprog_ip import _linprog_ip
[2022-03-09T08:28:51.217Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog_ip.py:27: in <module>
[2022-03-09T08:28:51.217Z] from ._linprog_util import _postsolve
[2022-03-09T08:28:51.217Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog_util.py:9: in <module>
[2022-03-09T08:28:51.217Z] from scipy.optimize._remove_redundancy import (
[2022-03-09T08:28:51.217Z] /usr/lib/python3.10/site-packages/scipy/optimize/_remove_redundancy.py:9: in <module>
[2022-03-09T08:28:51.217Z] from scipy.linalg.interpolative import interp_decomp
[2022-03-09T08:28:51.217Z] /usr/lib/python3.10/site-packages/scipy/linalg/interpolative.py:385: in <module>
[2022-03-09T08:28:51.217Z] import scipy.linalg._interpolative_backend as _backend
[2022-03-09T08:28:51.217Z] _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
[2022-03-09T08:28:51.217Z]
[2022-03-09T08:28:51.217Z] #******************************************************************************
[2022-03-09T08:28:51.217Z] # Copyright (C) 2013 Kenneth L. Ho
[2022-03-09T08:28:51.217Z] #
[2022-03-09T08:28:51.218Z] # Redistribution and use in source and binary forms, with or without
[2022-03-09T08:28:51.218Z] # modification, are permitted provided that the following conditions are met:
[2022-03-09T08:28:51.218Z] #
[2022-03-09T08:28:51.218Z] # Redistributions of source code must retain the above copyright notice, this
[2022-03-09T08:28:51.218Z] # list of conditions and the following disclaimer. Redistributions in binary
[2022-03-09T08:28:51.218Z] # form must reproduce the above copyright notice, this list of conditions and
[2022-03-09T08:28:51.218Z] # the following disclaimer in the documentation and/or other materials
[2022-03-09T08:28:51.218Z] # provided with the distribution.
[2022-03-09T08:28:51.218Z] #
[2022-03-09T08:28:51.218Z] # None of the names of the copyright holders may be used to endorse or
[2022-03-09T08:28:51.218Z] # promote products derived from this software without specific prior written
[2022-03-09T08:28:51.218Z] # permission.
[2022-03-09T08:28:51.218Z] #
[2022-03-09T08:28:51.218Z] # THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
[2022-03-09T08:28:51.218Z] # AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
[2022-03-09T08:28:51.218Z] # IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
[2022-03-09T08:28:51.218Z] # ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
[2022-03-09T08:28:51.218Z] # LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
[2022-03-09T08:28:51.218Z] # CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
[2022-03-09T08:28:51.218Z] # SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
[2022-03-09T08:28:51.218Z] # INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
[2022-03-09T08:28:51.218Z] # CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
[2022-03-09T08:28:51.218Z] # ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
[2022-03-09T08:28:51.218Z] # POSSIBILITY OF SUCH DAMAGE.
[2022-03-09T08:28:51.218Z] #******************************************************************************
[2022-03-09T08:28:51.218Z]
[2022-03-09T08:28:51.218Z] """
[2022-03-09T08:28:51.218Z] Direct wrappers for Fortran `id_dist` backend.
[2022-03-09T08:28:51.218Z] """
[2022-03-09T08:28:51.218Z]
[2022-03-09T08:28:51.218Z] > import scipy.linalg._interpolative as _id
[2022-03-09T08:28:51.218Z] E ImportError: /usr/lib/python3.10/site-packages/scipy/linalg/_interpolative.cpython-310-x86_64-linux-gnu.so: undefined symbol: _ZGVbN2v_sin
[2022-03-09T08:28:51.218Z]
[2022-03-09T08:28:51.218Z] /usr/lib/python3.10/site-packages/scipy/linalg/_interpolative_backend.py:34: ImportError
[2022-03-09T08:28:51.218Z] ______________________________ test_asadpour_tsp _______________________________
[2022-03-09T08:28:51.218Z]
[2022-03-09T08:28:51.218Z] def test_asadpour_tsp():
[2022-03-09T08:28:51.218Z] """
[2022-03-09T08:28:51.218Z] Test the complete asadpour tsp algorithm with the fractional, symmetric
[2022-03-09T08:28:51.218Z] Held Karp solution. This test also uses an incomplete graph as input.
[2022-03-09T08:28:51.218Z] """
[2022-03-09T08:28:51.218Z] # This version of Figure 2 has all of the edge weights multiplied by 100
[2022-03-09T08:28:51.218Z] # and the 0 weight edges have a weight of 1.
[2022-03-09T08:28:51.218Z] pytest.importorskip("numpy")
[2022-03-09T08:28:51.218Z] pytest.importorskip("scipy")
[2022-03-09T08:28:51.218Z]
[2022-03-09T08:28:51.218Z] edge_list = [
[2022-03-09T08:28:51.218Z] (0, 1, 100),
[2022-03-09T08:28:51.218Z] (0, 2, 100),
[2022-03-09T08:28:51.218Z] (0, 5, 1),
[2022-03-09T08:28:51.218Z] (1, 2, 100),
[2022-03-09T08:28:51.218Z] (1, 4, 1),
[2022-03-09T08:28:51.218Z] (2, 3, 1),
[2022-03-09T08:28:51.218Z] (3, 4, 100),
[2022-03-09T08:28:51.218Z] (3, 5, 100),
[2022-03-09T08:28:51.218Z] (4, 5, 100),
[2022-03-09T08:28:51.218Z] (1, 0, 100),
[2022-03-09T08:28:51.218Z] (2, 0, 100),
[2022-03-09T08:28:51.218Z] (5, 0, 1),
[2022-03-09T08:28:51.218Z] (2, 1, 100),
[2022-03-09T08:28:51.218Z] (4, 1, 1),
[2022-03-09T08:28:51.218Z] (3, 2, 1),
[2022-03-09T08:28:51.218Z] (4, 3, 100),
[2022-03-09T08:28:51.218Z] (5, 3, 100),
[2022-03-09T08:28:51.218Z] (5, 4, 100),
[2022-03-09T08:28:51.218Z] ]
[2022-03-09T08:28:51.218Z]
[2022-03-09T08:28:51.218Z] G = nx.DiGraph()
[2022-03-09T08:28:51.218Z] G.add_weighted_edges_from(edge_list)
[2022-03-09T08:28:51.218Z]
[2022-03-09T08:28:51.218Z] def fixed_asadpour(G, weight):
[2022-03-09T08:28:51.218Z] return nx_app.asadpour_atsp(G, weight, 19)
[2022-03-09T08:28:51.218Z]
[2022-03-09T08:28:51.218Z] > tour = nx_app.traveling_salesman_problem(G, weight="weight", method=fixed_asadpour)
[2022-03-09T08:28:51.218Z]
[2022-03-09T08:28:51.218Z] networkx/algorithms/approximation/tests/test_traveling_salesman.py:870:
[2022-03-09T08:28:51.218Z] _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
[2022-03-09T08:28:51.218Z] networkx/algorithms/approximation/traveling_salesman.py:319: in traveling_salesman_problem
[2022-03-09T08:28:51.218Z] best_GG = method(GG, weight)
[2022-03-09T08:28:51.218Z] networkx/algorithms/approximation/tests/test_traveling_salesman.py:868: in fixed_asadpour
[2022-03-09T08:28:51.218Z] return nx_app.asadpour_atsp(G, weight, 19)
[2022-03-09T08:28:51.218Z] networkx/utils/decorators.py:816: in func
[2022-03-09T08:28:51.218Z] return argmap._lazy_compile(__wrapper)(*args, **kwargs)
[2022-03-09T08:28:51.218Z] <class 'networkx.utils.decorators.argmap'> compilation 171:4: in argmap_asadpour_atsp_168
[2022-03-09T08:28:51.218Z] ???
[2022-03-09T08:28:51.219Z] networkx/algorithms/approximation/traveling_salesman.py:423: in asadpour_atsp
[2022-03-09T08:28:51.219Z] opt_hk, z_star = held_karp_ascent(G, weight)
[2022-03-09T08:28:51.219Z] networkx/algorithms/approximation/traveling_salesman.py:533: in held_karp_ascent
[2022-03-09T08:28:51.219Z] import scipy.optimize as optimize
[2022-03-09T08:28:51.219Z] /usr/lib/python3.10/site-packages/scipy/optimize/__init__.py:412: in <module>
[2022-03-09T08:28:51.219Z] from ._linprog import linprog, linprog_verbose_callback
[2022-03-09T08:28:51.219Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog.py:23: in <module>
[2022-03-09T08:28:51.219Z] from ._linprog_ip import _linprog_ip
[2022-03-09T08:28:51.219Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog_ip.py:27: in <module>
[2022-03-09T08:28:51.219Z] from ._linprog_util import _postsolve
[2022-03-09T08:28:51.219Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog_util.py:9: in <module>
[2022-03-09T08:28:51.219Z] from scipy.optimize._remove_redundancy import (
[2022-03-09T08:28:51.219Z] /usr/lib/python3.10/site-packages/scipy/optimize/_remove_redundancy.py:9: in <module>
[2022-03-09T08:28:51.219Z] from scipy.linalg.interpolative import interp_decomp
[2022-03-09T08:28:51.219Z] /usr/lib/python3.10/site-packages/scipy/linalg/interpolative.py:385: in <module>
[2022-03-09T08:28:51.219Z] import scipy.linalg._interpolative_backend as _backend
[2022-03-09T08:28:51.219Z] _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
[2022-03-09T08:28:51.219Z]
[2022-03-09T08:28:51.219Z] #******************************************************************************
[2022-03-09T08:28:51.219Z] # Copyright (C) 2013 Kenneth L. Ho
[2022-03-09T08:28:51.219Z] #
[2022-03-09T08:28:51.219Z] # Redistribution and use in source and binary forms, with or without
[2022-03-09T08:28:51.219Z] # modification, are permitted provided that the following conditions are met:
[2022-03-09T08:28:51.219Z] #
[2022-03-09T08:28:51.219Z] # Redistributions of source code must retain the above copyright notice, this
[2022-03-09T08:28:51.219Z] # list of conditions and the following disclaimer. Redistributions in binary
[2022-03-09T08:28:51.219Z] # form must reproduce the above copyright notice, this list of conditions and
[2022-03-09T08:28:51.219Z] # the following disclaimer in the documentation and/or other materials
[2022-03-09T08:28:51.219Z] # provided with the distribution.
[2022-03-09T08:28:51.219Z] #
[2022-03-09T08:28:51.219Z] # None of the names of the copyright holders may be used to endorse or
[2022-03-09T08:28:51.219Z] # promote products derived from this software without specific prior written
[2022-03-09T08:28:51.219Z] # permission.
[2022-03-09T08:28:51.219Z] #
[2022-03-09T08:28:51.219Z] # THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
[2022-03-09T08:28:51.219Z] # AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
[2022-03-09T08:28:51.219Z] # IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
[2022-03-09T08:28:51.219Z] # ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
[2022-03-09T08:28:51.219Z] # LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
[2022-03-09T08:28:51.219Z] # CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
[2022-03-09T08:28:51.219Z] # SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
[2022-03-09T08:28:51.219Z] # INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
[2022-03-09T08:28:51.219Z] # CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
[2022-03-09T08:28:51.219Z] # ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
[2022-03-09T08:28:51.219Z] # POSSIBILITY OF SUCH DAMAGE.
[2022-03-09T08:28:51.219Z] #******************************************************************************
[2022-03-09T08:28:51.219Z]
[2022-03-09T08:28:51.219Z] """
[2022-03-09T08:28:51.219Z] Direct wrappers for Fortran `id_dist` backend.
[2022-03-09T08:28:51.219Z] """
[2022-03-09T08:28:51.219Z]
[2022-03-09T08:28:51.219Z] > import scipy.linalg._interpolative as _id
[2022-03-09T08:28:51.219Z] E ImportError: /usr/lib/python3.10/site-packages/scipy/linalg/_interpolative.cpython-310-x86_64-linux-gnu.so: undefined symbol: _ZGVbN2v_sin
[2022-03-09T08:28:51.219Z]
[2022-03-09T08:28:51.219Z] /usr/lib/python3.10/site-packages/scipy/linalg/_interpolative_backend.py:34: ImportError
[2022-03-09T08:28:51.219Z] ___________________________ test_asadpour_real_world ___________________________
[2022-03-09T08:28:51.219Z]
[2022-03-09T08:28:51.219Z] def test_asadpour_real_world():
[2022-03-09T08:28:51.219Z] """
[2022-03-09T08:28:51.219Z] This test uses airline prices between the six largest cities in the US.
[2022-03-09T08:28:51.219Z]
[2022-03-09T08:28:51.219Z] * New York City -> JFK
[2022-03-09T08:28:51.219Z] * Los Angeles -> LAX
[2022-03-09T08:28:51.219Z] * Chicago -> ORD
[2022-03-09T08:28:51.219Z] * Houston -> IAH
[2022-03-09T08:28:51.219Z] * Phoenix -> PHX
[2022-03-09T08:28:51.219Z] * Philadelphia -> PHL
[2022-03-09T08:28:51.219Z]
[2022-03-09T08:28:51.219Z] Flight prices from August 2021 using Delta or American airlines to get
[2022-03-09T08:28:51.219Z] nonstop flight. The brute force solution found the optimal tour to cost $872
[2022-03-09T08:28:51.219Z]
[2022-03-09T08:28:51.219Z] This test also uses the `source` keyword argument to ensure that the tour
[2022-03-09T08:28:51.219Z] always starts at city 0.
[2022-03-09T08:28:51.220Z] """
[2022-03-09T08:28:51.220Z] np = pytest.importorskip("numpy")
[2022-03-09T08:28:51.220Z] pytest.importorskip("scipy")
[2022-03-09T08:28:51.220Z]
[2022-03-09T08:28:51.220Z] G_array = np.array(
[2022-03-09T08:28:51.220Z] [
[2022-03-09T08:28:51.220Z] # JFK LAX ORD IAH PHX PHL
[2022-03-09T08:28:51.220Z] [0, 243, 199, 208, 169, 183], # JFK
[2022-03-09T08:28:51.220Z] [277, 0, 217, 123, 127, 252], # LAX
[2022-03-09T08:28:51.220Z] [297, 197, 0, 197, 123, 177], # ORD
[2022-03-09T08:28:51.220Z] [303, 169, 197, 0, 117, 117], # IAH
[2022-03-09T08:28:51.220Z] [257, 127, 160, 117, 0, 319], # PHX
[2022-03-09T08:28:51.220Z] [183, 332, 217, 117, 319, 0], # PHL
[2022-03-09T08:28:51.220Z] ]
[2022-03-09T08:28:51.220Z] )
[2022-03-09T08:28:51.220Z]
[2022-03-09T08:28:51.220Z] node_map = {0: "JFK", 1: "LAX", 2: "ORD", 3: "IAH", 4: "PHX", 5: "PHL"}
[2022-03-09T08:28:51.220Z]
[2022-03-09T08:28:51.220Z] expected_tours = [
[2022-03-09T08:28:51.220Z] ["JFK", "LAX", "PHX", "ORD", "IAH", "PHL", "JFK"],
[2022-03-09T08:28:51.220Z] ["JFK", "ORD", "PHX", "LAX", "IAH", "PHL", "JFK"],
[2022-03-09T08:28:51.220Z] ]
[2022-03-09T08:28:51.220Z]
[2022-03-09T08:28:51.220Z] G = nx.from_numpy_array(G_array, create_using=nx.DiGraph)
[2022-03-09T08:28:51.220Z] nx.relabel_nodes(G, node_map, copy=False)
[2022-03-09T08:28:51.220Z]
[2022-03-09T08:28:51.220Z] def fixed_asadpour(G, weight):
[2022-03-09T08:28:51.220Z] return nx_app.asadpour_atsp(G, weight, 37, source="JFK")
[2022-03-09T08:28:51.220Z]
[2022-03-09T08:28:51.220Z] > tour = nx_app.traveling_salesman_problem(G, weight="weight", method=fixed_asadpour)
[2022-03-09T08:28:51.220Z]
[2022-03-09T08:28:51.220Z] networkx/algorithms/approximation/tests/test_traveling_salesman.py:937:
[2022-03-09T08:28:51.220Z] _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
[2022-03-09T08:28:51.220Z] networkx/algorithms/approximation/traveling_salesman.py:319: in traveling_salesman_problem
[2022-03-09T08:28:51.220Z] best_GG = method(GG, weight)
[2022-03-09T08:28:51.220Z] networkx/algorithms/approximation/tests/test_traveling_salesman.py:935: in fixed_asadpour
[2022-03-09T08:28:51.220Z] return nx_app.asadpour_atsp(G, weight, 37, source="JFK")
[2022-03-09T08:28:51.220Z] <class 'networkx.utils.decorators.argmap'> compilation 171:4: in argmap_asadpour_atsp_168
[2022-03-09T08:28:51.220Z] ???
[2022-03-09T08:28:51.220Z] networkx/algorithms/approximation/traveling_salesman.py:423: in asadpour_atsp
[2022-03-09T08:28:51.220Z] opt_hk, z_star = held_karp_ascent(G, weight)
[2022-03-09T08:28:51.220Z] networkx/algorithms/approximation/traveling_salesman.py:533: in held_karp_ascent
[2022-03-09T08:28:51.220Z] import scipy.optimize as optimize
[2022-03-09T08:28:51.220Z] /usr/lib/python3.10/site-packages/scipy/optimize/__init__.py:412: in <module>
[2022-03-09T08:28:51.220Z] from ._linprog import linprog, linprog_verbose_callback
[2022-03-09T08:28:51.220Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog.py:23: in <module>
[2022-03-09T08:28:51.220Z] from ._linprog_ip import _linprog_ip
[2022-03-09T08:28:51.220Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog_ip.py:27: in <module>
[2022-03-09T08:28:51.220Z] from ._linprog_util import _postsolve
[2022-03-09T08:28:51.220Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog_util.py:9: in <module>
[2022-03-09T08:28:51.220Z] from scipy.optimize._remove_redundancy import (
[2022-03-09T08:28:51.220Z] /usr/lib/python3.10/site-packages/scipy/optimize/_remove_redundancy.py:9: in <module>
[2022-03-09T08:28:51.220Z] from scipy.linalg.interpolative import interp_decomp
[2022-03-09T08:28:51.220Z] /usr/lib/python3.10/site-packages/scipy/linalg/interpolative.py:385: in <module>
[2022-03-09T08:28:51.220Z] import scipy.linalg._interpolative_backend as _backend
[2022-03-09T08:28:51.220Z] _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
[2022-03-09T08:28:51.220Z]
[2022-03-09T08:28:51.220Z] #******************************************************************************
[2022-03-09T08:28:51.220Z] # Copyright (C) 2013 Kenneth L. Ho
[2022-03-09T08:28:51.220Z] #
[2022-03-09T08:28:51.220Z] # Redistribution and use in source and binary forms, with or without
[2022-03-09T08:28:51.220Z] # modification, are permitted provided that the following conditions are met:
[2022-03-09T08:28:51.220Z] #
[2022-03-09T08:28:51.220Z] # Redistributions of source code must retain the above copyright notice, this
[2022-03-09T08:28:51.220Z] # list of conditions and the following disclaimer. Redistributions in binary
[2022-03-09T08:28:51.220Z] # form must reproduce the above copyright notice, this list of conditions and
[2022-03-09T08:28:51.220Z] # the following disclaimer in the documentation and/or other materials
[2022-03-09T08:28:51.220Z] # provided with the distribution.
[2022-03-09T08:28:51.220Z] #
[2022-03-09T08:28:51.220Z] # None of the names of the copyright holders may be used to endorse or
[2022-03-09T08:28:51.220Z] # promote products derived from this software without specific prior written
[2022-03-09T08:28:51.220Z] # permission.
[2022-03-09T08:28:51.220Z] #
[2022-03-09T08:28:51.220Z] # THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
[2022-03-09T08:28:51.220Z] # AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
[2022-03-09T08:28:51.220Z] # IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
[2022-03-09T08:28:51.220Z] # ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
[2022-03-09T08:28:51.220Z] # LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
[2022-03-09T08:28:51.221Z] # CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
[2022-03-09T08:28:51.221Z] # SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
[2022-03-09T08:28:51.221Z] # INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
[2022-03-09T08:28:51.221Z] # CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
[2022-03-09T08:28:51.221Z] # ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
[2022-03-09T08:28:51.221Z] # POSSIBILITY OF SUCH DAMAGE.
[2022-03-09T08:28:51.221Z] #******************************************************************************
[2022-03-09T08:28:51.221Z]
[2022-03-09T08:28:51.221Z] """
[2022-03-09T08:28:51.221Z] Direct wrappers for Fortran `id_dist` backend.
[2022-03-09T08:28:51.221Z] """
[2022-03-09T08:28:51.221Z]
[2022-03-09T08:28:51.221Z] > import scipy.linalg._interpolative as _id
[2022-03-09T08:28:51.221Z] E ImportError: /usr/lib/python3.10/site-packages/scipy/linalg/_interpolative.cpython-310-x86_64-linux-gnu.so: undefined symbol: _ZGVbN2v_sin
[2022-03-09T08:28:51.221Z]
[2022-03-09T08:28:51.221Z] /usr/lib/python3.10/site-packages/scipy/linalg/_interpolative_backend.py:34: ImportError
[2022-03-09T08:28:51.221Z] ________________________ test_asadpour_real_world_path _________________________
[2022-03-09T08:28:51.221Z]
[2022-03-09T08:28:51.221Z] def test_asadpour_real_world_path():
[2022-03-09T08:28:51.221Z] """
[2022-03-09T08:28:51.221Z] This test uses airline prices between the six largest cities in the US. This
[2022-03-09T08:28:51.221Z] time using a path, not a cycle.
[2022-03-09T08:28:51.221Z]
[2022-03-09T08:28:51.221Z] * New York City -> JFK
[2022-03-09T08:28:51.221Z] * Los Angeles -> LAX
[2022-03-09T08:28:51.221Z] * Chicago -> ORD
[2022-03-09T08:28:51.221Z] * Houston -> IAH
[2022-03-09T08:28:51.221Z] * Phoenix -> PHX
[2022-03-09T08:28:51.221Z] * Philadelphia -> PHL
[2022-03-09T08:28:51.221Z]
[2022-03-09T08:28:51.221Z] Flight prices from August 2021 using Delta or American airlines to get
[2022-03-09T08:28:51.221Z] nonstop flight. The brute force solution found the optimal tour to cost $872
[2022-03-09T08:28:51.221Z] """
[2022-03-09T08:28:51.221Z] np = pytest.importorskip("numpy")
[2022-03-09T08:28:51.221Z] pytest.importorskip("scipy")
[2022-03-09T08:28:51.221Z]
[2022-03-09T08:28:51.221Z] G_array = np.array(
[2022-03-09T08:28:51.221Z] [
[2022-03-09T08:28:51.221Z] # JFK LAX ORD IAH PHX PHL
[2022-03-09T08:28:51.221Z] [0, 243, 199, 208, 169, 183], # JFK
[2022-03-09T08:28:51.221Z] [277, 0, 217, 123, 127, 252], # LAX
[2022-03-09T08:28:51.221Z] [297, 197, 0, 197, 123, 177], # ORD
[2022-03-09T08:28:51.221Z] [303, 169, 197, 0, 117, 117], # IAH
[2022-03-09T08:28:51.221Z] [257, 127, 160, 117, 0, 319], # PHX
[2022-03-09T08:28:51.221Z] [183, 332, 217, 117, 319, 0], # PHL
[2022-03-09T08:28:51.221Z] ]
[2022-03-09T08:28:51.221Z] )
[2022-03-09T08:28:51.221Z]
[2022-03-09T08:28:51.221Z] node_map = {0: "JFK", 1: "LAX", 2: "ORD", 3: "IAH", 4: "PHX", 5: "PHL"}
[2022-03-09T08:28:51.221Z]
[2022-03-09T08:28:51.221Z] expected_paths = [
[2022-03-09T08:28:51.221Z] ["ORD", "PHX", "LAX", "IAH", "PHL", "JFK"],
[2022-03-09T08:28:51.221Z] ["JFK", "PHL", "IAH", "ORD", "PHX", "LAX"],
[2022-03-09T08:28:51.221Z] ]
[2022-03-09T08:28:51.221Z]
[2022-03-09T08:28:51.221Z] G = nx.from_numpy_array(G_array, create_using=nx.DiGraph)
[2022-03-09T08:28:51.221Z] nx.relabel_nodes(G, node_map, copy=False)
[2022-03-09T08:28:51.221Z]
[2022-03-09T08:28:51.221Z] def fixed_asadpour(G, weight):
[2022-03-09T08:28:51.221Z] return nx_app.asadpour_atsp(G, weight, 56)
[2022-03-09T08:28:51.221Z]
[2022-03-09T08:28:51.221Z] > path = nx_app.traveling_salesman_problem(
[2022-03-09T08:28:51.221Z] G, weight="weight", cycle=False, method=fixed_asadpour
[2022-03-09T08:28:51.221Z] )
[2022-03-09T08:28:51.221Z]
[2022-03-09T08:28:51.221Z] networkx/algorithms/approximation/tests/test_traveling_salesman.py:985:
[2022-03-09T08:28:51.221Z] _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
[2022-03-09T08:28:51.221Z] networkx/algorithms/approximation/traveling_salesman.py:319: in traveling_salesman_problem
[2022-03-09T08:28:51.221Z] best_GG = method(GG, weight)
[2022-03-09T08:28:51.221Z] networkx/algorithms/approximation/tests/test_traveling_salesman.py:983: in fixed_asadpour
[2022-03-09T08:28:51.221Z] return nx_app.asadpour_atsp(G, weight, 56)
[2022-03-09T08:28:51.221Z] <class 'networkx.utils.decorators.argmap'> compilation 171:4: in argmap_asadpour_atsp_168
[2022-03-09T08:28:51.221Z] ???
[2022-03-09T08:28:51.221Z] networkx/algorithms/approximation/traveling_salesman.py:423: in asadpour_atsp
[2022-03-09T08:28:51.221Z] opt_hk, z_star = held_karp_ascent(G, weight)
[2022-03-09T08:28:51.221Z] networkx/algorithms/approximation/traveling_salesman.py:533: in held_karp_ascent
[2022-03-09T08:28:51.221Z] import scipy.optimize as optimize
[2022-03-09T08:28:51.221Z] /usr/lib/python3.10/site-packages/scipy/optimize/__init__.py:412: in <module>
[2022-03-09T08:28:51.221Z] from ._linprog import linprog, linprog_verbose_callback
[2022-03-09T08:28:51.221Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog.py:23: in <module>
[2022-03-09T08:28:51.221Z] from ._linprog_ip import _linprog_ip
[2022-03-09T08:28:51.221Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog_ip.py:27: in <module>
[2022-03-09T08:28:51.221Z] from ._linprog_util import _postsolve
[2022-03-09T08:28:51.221Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog_util.py:9: in <module>
[2022-03-09T08:28:51.221Z] from scipy.optimize._remove_redundancy import (
[2022-03-09T08:28:51.222Z] /usr/lib/python3.10/site-packages/scipy/optimize/_remove_redundancy.py:9: in <module>
[2022-03-09T08:28:51.222Z] from scipy.linalg.interpolative import interp_decomp
[2022-03-09T08:28:51.222Z] /usr/lib/python3.10/site-packages/scipy/linalg/interpolative.py:385: in <module>
[2022-03-09T08:28:51.222Z] import scipy.linalg._interpolative_backend as _backend
[2022-03-09T08:28:51.222Z] _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
[2022-03-09T08:28:51.222Z]
[2022-03-09T08:28:51.222Z] #******************************************************************************
[2022-03-09T08:28:51.222Z] # Copyright (C) 2013 Kenneth L. Ho
[2022-03-09T08:28:51.222Z] #
[2022-03-09T08:28:51.222Z] # Redistribution and use in source and binary forms, with or without
[2022-03-09T08:28:51.222Z] # modification, are permitted provided that the following conditions are met:
[2022-03-09T08:28:51.222Z] #
[2022-03-09T08:28:51.222Z] # Redistributions of source code must retain the above copyright notice, this
[2022-03-09T08:28:51.222Z] # list of conditions and the following disclaimer. Redistributions in binary
[2022-03-09T08:28:51.222Z] # form must reproduce the above copyright notice, this list of conditions and
[2022-03-09T08:28:51.222Z] # the following disclaimer in the documentation and/or other materials
[2022-03-09T08:28:51.222Z] # provided with the distribution.
[2022-03-09T08:28:51.222Z] #
[2022-03-09T08:28:51.222Z] # None of the names of the copyright holders may be used to endorse or
[2022-03-09T08:28:51.222Z] # promote products derived from this software without specific prior written
[2022-03-09T08:28:51.222Z] # permission.
[2022-03-09T08:28:51.222Z] #
[2022-03-09T08:28:51.222Z] # THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
[2022-03-09T08:28:51.222Z] # AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
[2022-03-09T08:28:51.222Z] # IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
[2022-03-09T08:28:51.222Z] # ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
[2022-03-09T08:28:51.222Z] # LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
[2022-03-09T08:28:51.222Z] # CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
[2022-03-09T08:28:51.222Z] # SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
[2022-03-09T08:28:51.222Z] # INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
[2022-03-09T08:28:51.222Z] # CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
[2022-03-09T08:28:51.222Z] # ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
[2022-03-09T08:28:51.222Z] # POSSIBILITY OF SUCH DAMAGE.
[2022-03-09T08:28:51.222Z] #******************************************************************************
[2022-03-09T08:28:51.222Z]
[2022-03-09T08:28:51.222Z] """
[2022-03-09T08:28:51.222Z] Direct wrappers for Fortran `id_dist` backend.
[2022-03-09T08:28:51.222Z] """
[2022-03-09T08:28:51.222Z]
[2022-03-09T08:28:51.222Z] > import scipy.linalg._interpolative as _id
[2022-03-09T08:28:51.222Z] E ImportError: /usr/lib/python3.10/site-packages/scipy/linalg/_interpolative.cpython-310-x86_64-linux-gnu.so: undefined symbol: _ZGVbN2v_sin
[2022-03-09T08:28:51.222Z]
[2022-03-09T08:28:51.222Z] /usr/lib/python3.10/site-packages/scipy/linalg/_interpolative_backend.py:34: ImportError
[2022-03-09T08:28:51.222Z] ___ TestDegreeMixingCorrelation.test_degree_pearson_assortativity_undirected ___
[2022-03-09T08:28:51.222Z]
[2022-03-09T08:28:51.222Z] self = <networkx.algorithms.assortativity.tests.test_correlation.TestDegreeMixingCorrelation object at 0x7fe886141f30>
[2022-03-09T08:28:51.222Z]
[2022-03-09T08:28:51.222Z] def test_degree_pearson_assortativity_undirected(self):
[2022-03-09T08:28:51.222Z] > r = nx.degree_pearson_correlation_coefficient(self.P4)
[2022-03-09T08:28:51.222Z]
[2022-03-09T08:28:51.222Z] networkx/algorithms/assortativity/tests/test_correlation.py:37:
[2022-03-09T08:28:51.222Z] _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
[2022-03-09T08:28:51.222Z] networkx/algorithms/assortativity/correlation.py:153: in degree_pearson_correlation_coefficient
[2022-03-09T08:28:51.222Z] import scipy.stats # call as sp.stats
[2022-03-09T08:28:51.222Z] /usr/lib/python3.10/site-packages/scipy/stats/__init__.py:453: in <module>
[2022-03-09T08:28:51.222Z] from ._stats_py import *
[2022-03-09T08:28:51.222Z] /usr/lib/python3.10/site-packages/scipy/stats/_stats_py.py:44: in <module>
[2022-03-09T08:28:51.222Z] from . import distributions
[2022-03-09T08:28:51.222Z] /usr/lib/python3.10/site-packages/scipy/stats/distributions.py:8: in <module>
[2022-03-09T08:28:51.222Z] from ._distn_infrastructure import (rv_discrete, rv_continuous, rv_frozen)
[2022-03-09T08:28:51.222Z] /usr/lib/python3.10/site-packages/scipy/stats/_distn_infrastructure.py:24: in <module>
[2022-03-09T08:28:51.222Z] from scipy import optimize
[2022-03-09T08:28:51.222Z] /usr/lib/python3.10/site-packages/scipy/optimize/__init__.py:412: in <module>
[2022-03-09T08:28:51.222Z] from ._linprog import linprog, linprog_verbose_callback
[2022-03-09T08:28:51.222Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog.py:23: in <module>
[2022-03-09T08:28:51.222Z] from ._linprog_ip import _linprog_ip
[2022-03-09T08:28:51.222Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog_ip.py:27: in <module>
[2022-03-09T08:28:51.222Z] from ._linprog_util import _postsolve
[2022-03-09T08:28:51.222Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog_util.py:9: in <module>
[2022-03-09T08:28:51.222Z] from scipy.optimize._remove_redundancy import (
[2022-03-09T08:28:51.223Z] /usr/lib/python3.10/site-packages/scipy/optimize/_remove_redundancy.py:9: in <module>
[2022-03-09T08:28:51.223Z] from scipy.linalg.interpolative import interp_decomp
[2022-03-09T08:28:51.223Z] /usr/lib/python3.10/site-packages/scipy/linalg/interpolative.py:385: in <module>
[2022-03-09T08:28:51.223Z] import scipy.linalg._interpolative_backend as _backend
[2022-03-09T08:28:51.223Z] _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
[2022-03-09T08:28:51.223Z]
[2022-03-09T08:28:51.223Z] #******************************************************************************
[2022-03-09T08:28:51.223Z] # Copyright (C) 2013 Kenneth L. Ho
[2022-03-09T08:28:51.223Z] #
[2022-03-09T08:28:51.223Z] # Redistribution and use in source and binary forms, with or without
[2022-03-09T08:28:51.223Z] # modification, are permitted provided that the following conditions are met:
[2022-03-09T08:28:51.223Z] #
[2022-03-09T08:28:51.223Z] # Redistributions of source code must retain the above copyright notice, this
[2022-03-09T08:28:51.223Z] # list of conditions and the following disclaimer. Redistributions in binary
[2022-03-09T08:28:51.223Z] # form must reproduce the above copyright notice, this list of conditions and
[2022-03-09T08:28:51.223Z] # the following disclaimer in the documentation and/or other materials
[2022-03-09T08:28:51.223Z] # provided with the distribution.
[2022-03-09T08:28:51.223Z] #
[2022-03-09T08:28:51.223Z] # None of the names of the copyright holders may be used to endorse or
[2022-03-09T08:28:51.223Z] # promote products derived from this software without specific prior written
[2022-03-09T08:28:51.223Z] # permission.
[2022-03-09T08:28:51.223Z] #
[2022-03-09T08:28:51.223Z] # THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
[2022-03-09T08:28:51.223Z] # AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
[2022-03-09T08:28:51.223Z] # IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
[2022-03-09T08:28:51.223Z] # ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
[2022-03-09T08:28:51.223Z] # LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
[2022-03-09T08:28:51.223Z] # CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
[2022-03-09T08:28:51.223Z] # SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
[2022-03-09T08:28:51.223Z] # INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
[2022-03-09T08:28:51.223Z] # CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
[2022-03-09T08:28:51.223Z] # ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
[2022-03-09T08:28:51.223Z] # POSSIBILITY OF SUCH DAMAGE.
[2022-03-09T08:28:51.223Z] #******************************************************************************
[2022-03-09T08:28:51.223Z]
[2022-03-09T08:28:51.223Z] """
[2022-03-09T08:28:51.223Z] Direct wrappers for Fortran `id_dist` backend.
[2022-03-09T08:28:51.223Z] """
[2022-03-09T08:28:51.223Z]
[2022-03-09T08:28:51.223Z] > import scipy.linalg._interpolative as _id
[2022-03-09T08:28:51.223Z] E ImportError: /usr/lib/python3.10/site-packages/scipy/linalg/_interpolative.cpython-310-x86_64-linux-gnu.so: undefined symbol: _ZGVbN2v_sin
[2022-03-09T08:28:51.223Z]
[2022-03-09T08:28:51.223Z] /usr/lib/python3.10/site-packages/scipy/linalg/_interpolative_backend.py:34: ImportError
[2022-03-09T08:28:51.223Z] ____ TestDegreeMixingCorrelation.test_degree_pearson_assortativity_directed ____
[2022-03-09T08:28:51.223Z]
[2022-03-09T08:28:51.223Z] self = <networkx.algorithms.assortativity.tests.test_correlation.TestDegreeMixingCorrelation object at 0x7fe886140f10>
[2022-03-09T08:28:51.223Z]
[2022-03-09T08:28:51.223Z] def test_degree_pearson_assortativity_directed(self):
[2022-03-09T08:28:51.223Z] > r = nx.degree_pearson_correlation_coefficient(self.D)
[2022-03-09T08:28:51.223Z]
[2022-03-09T08:28:51.223Z] networkx/algorithms/assortativity/tests/test_correlation.py:41:
[2022-03-09T08:28:51.223Z] _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
[2022-03-09T08:28:51.223Z] networkx/algorithms/assortativity/correlation.py:153: in degree_pearson_correlation_coefficient
[2022-03-09T08:28:51.223Z] import scipy.stats # call as sp.stats
[2022-03-09T08:28:51.223Z] /usr/lib/python3.10/site-packages/scipy/stats/__init__.py:453: in <module>
[2022-03-09T08:28:51.223Z] from ._stats_py import *
[2022-03-09T08:28:51.223Z] /usr/lib/python3.10/site-packages/scipy/stats/_stats_py.py:44: in <module>
[2022-03-09T08:28:51.223Z] from . import distributions
[2022-03-09T08:28:51.223Z] /usr/lib/python3.10/site-packages/scipy/stats/distributions.py:8: in <module>
[2022-03-09T08:28:51.223Z] from ._distn_infrastructure import (rv_discrete, rv_continuous, rv_frozen)
[2022-03-09T08:28:51.223Z] /usr/lib/python3.10/site-packages/scipy/stats/_distn_infrastructure.py:24: in <module>
[2022-03-09T08:28:51.223Z] from scipy import optimize
[2022-03-09T08:28:51.223Z] /usr/lib/python3.10/site-packages/scipy/optimize/__init__.py:412: in <module>
[2022-03-09T08:28:51.223Z] from ._linprog import linprog, linprog_verbose_callback
[2022-03-09T08:28:51.223Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog.py:23: in <module>
[2022-03-09T08:28:51.223Z] from ._linprog_ip import _linprog_ip
[2022-03-09T08:28:51.223Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog_ip.py:27: in <module>
[2022-03-09T08:28:51.223Z] from ._linprog_util import _postsolve
[2022-03-09T08:28:51.223Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog_util.py:9: in <module>
[2022-03-09T08:28:51.223Z] from scipy.optimize._remove_redundancy import (
[2022-03-09T08:28:51.224Z] /usr/lib/python3.10/site-packages/scipy/optimize/_remove_redundancy.py:9: in <module>
[2022-03-09T08:28:51.224Z] from scipy.linalg.interpolative import interp_decomp
[2022-03-09T08:28:51.224Z] /usr/lib/python3.10/site-packages/scipy/linalg/interpolative.py:385: in <module>
[2022-03-09T08:28:51.224Z] import scipy.linalg._interpolative_backend as _backend
[2022-03-09T08:28:51.224Z] _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
[2022-03-09T08:28:51.224Z]
[2022-03-09T08:28:51.224Z] #******************************************************************************
[2022-03-09T08:28:51.224Z] # Copyright (C) 2013 Kenneth L. Ho
[2022-03-09T08:28:51.224Z] #
[2022-03-09T08:28:51.224Z] # Redistribution and use in source and binary forms, with or without
[2022-03-09T08:28:51.224Z] # modification, are permitted provided that the following conditions are met:
[2022-03-09T08:28:51.224Z] #
[2022-03-09T08:28:51.224Z] # Redistributions of source code must retain the above copyright notice, this
[2022-03-09T08:28:51.224Z] # list of conditions and the following disclaimer. Redistributions in binary
[2022-03-09T08:28:51.224Z] # form must reproduce the above copyright notice, this list of conditions and
[2022-03-09T08:28:51.224Z] # the following disclaimer in the documentation and/or other materials
[2022-03-09T08:28:51.224Z] # provided with the distribution.
[2022-03-09T08:28:51.224Z] #
[2022-03-09T08:28:51.224Z] # None of the names of the copyright holders may be used to endorse or
[2022-03-09T08:28:51.224Z] # promote products derived from this software without specific prior written
[2022-03-09T08:28:51.224Z] # permission.
[2022-03-09T08:28:51.224Z] #
[2022-03-09T08:28:51.224Z] # THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
[2022-03-09T08:28:51.224Z] # AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
[2022-03-09T08:28:51.224Z] # IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
[2022-03-09T08:28:51.224Z] # ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
[2022-03-09T08:28:51.224Z] # LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
[2022-03-09T08:28:51.224Z] # CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
[2022-03-09T08:28:51.224Z] # SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
[2022-03-09T08:28:51.224Z] # INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
[2022-03-09T08:28:51.224Z] # CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
[2022-03-09T08:28:51.224Z] # ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
[2022-03-09T08:28:51.224Z] # POSSIBILITY OF SUCH DAMAGE.
[2022-03-09T08:28:51.224Z] #******************************************************************************
[2022-03-09T08:28:51.224Z]
[2022-03-09T08:28:51.224Z] """
[2022-03-09T08:28:51.224Z] Direct wrappers for Fortran `id_dist` backend.
[2022-03-09T08:28:51.224Z] """
[2022-03-09T08:28:51.224Z]
[2022-03-09T08:28:51.224Z] > import scipy.linalg._interpolative as _id
[2022-03-09T08:28:51.224Z] E ImportError: /usr/lib/python3.10/site-packages/scipy/linalg/_interpolative.cpython-310-x86_64-linux-gnu.so: undefined symbol: _ZGVbN2v_sin
[2022-03-09T08:28:51.224Z]
[2022-03-09T08:28:51.224Z] /usr/lib/python3.10/site-packages/scipy/linalg/_interpolative_backend.py:34: ImportError
[2022-03-09T08:28:51.224Z] ___ TestDegreeMixingCorrelation.test_degree_pearson_assortativity_directed2 ____
[2022-03-09T08:28:51.224Z]
[2022-03-09T08:28:51.224Z] self = <networkx.algorithms.assortativity.tests.test_correlation.TestDegreeMixingCorrelation object at 0x7fe886140ac0>
[2022-03-09T08:28:51.224Z]
[2022-03-09T08:28:51.224Z] def test_degree_pearson_assortativity_directed2(self):
[2022-03-09T08:28:51.224Z] """Test degree assortativity with Pearson for a directed graph where
[2022-03-09T08:28:51.224Z] the set of in/out degree does not equal the total degree."""
[2022-03-09T08:28:51.224Z] > r = nx.degree_pearson_correlation_coefficient(self.D2)
[2022-03-09T08:28:51.224Z]
[2022-03-09T08:28:51.224Z] networkx/algorithms/assortativity/tests/test_correlation.py:47:
[2022-03-09T08:28:51.224Z] _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
[2022-03-09T08:28:51.224Z] networkx/algorithms/assortativity/correlation.py:153: in degree_pearson_correlation_coefficient
[2022-03-09T08:28:51.224Z] import scipy.stats # call as sp.stats
[2022-03-09T08:28:51.224Z] /usr/lib/python3.10/site-packages/scipy/stats/__init__.py:453: in <module>
[2022-03-09T08:28:51.224Z] from ._stats_py import *
[2022-03-09T08:28:51.224Z] /usr/lib/python3.10/site-packages/scipy/stats/_stats_py.py:44: in <module>
[2022-03-09T08:28:51.224Z] from . import distributions
[2022-03-09T08:28:51.224Z] /usr/lib/python3.10/site-packages/scipy/stats/distributions.py:8: in <module>
[2022-03-09T08:28:51.224Z] from ._distn_infrastructure import (rv_discrete, rv_continuous, rv_frozen)
[2022-03-09T08:28:51.224Z] /usr/lib/python3.10/site-packages/scipy/stats/_distn_infrastructure.py:24: in <module>
[2022-03-09T08:28:51.224Z] from scipy import optimize
[2022-03-09T08:28:51.224Z] /usr/lib/python3.10/site-packages/scipy/optimize/__init__.py:412: in <module>
[2022-03-09T08:28:51.224Z] from ._linprog import linprog, linprog_verbose_callback
[2022-03-09T08:28:51.224Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog.py:23: in <module>
[2022-03-09T08:28:51.224Z] from ._linprog_ip import _linprog_ip
[2022-03-09T08:28:51.224Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog_ip.py:27: in <module>
[2022-03-09T08:28:51.224Z] from ._linprog_util import _postsolve
[2022-03-09T08:28:51.225Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog_util.py:9: in <module>
[2022-03-09T08:28:51.225Z] from scipy.optimize._remove_redundancy import (
[2022-03-09T08:28:51.225Z] /usr/lib/python3.10/site-packages/scipy/optimize/_remove_redundancy.py:9: in <module>
[2022-03-09T08:28:51.225Z] from scipy.linalg.interpolative import interp_decomp
[2022-03-09T08:28:51.225Z] /usr/lib/python3.10/site-packages/scipy/linalg/interpolative.py:385: in <module>
[2022-03-09T08:28:51.225Z] import scipy.linalg._interpolative_backend as _backend
[2022-03-09T08:28:51.225Z] _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
[2022-03-09T08:28:51.225Z]
[2022-03-09T08:28:51.225Z] #******************************************************************************
[2022-03-09T08:28:51.225Z] # Copyright (C) 2013 Kenneth L. Ho
[2022-03-09T08:28:51.225Z] #
[2022-03-09T08:28:51.225Z] # Redistribution and use in source and binary forms, with or without
[2022-03-09T08:28:51.225Z] # modification, are permitted provided that the following conditions are met:
[2022-03-09T08:28:51.225Z] #
[2022-03-09T08:28:51.225Z] # Redistributions of source code must retain the above copyright notice, this
[2022-03-09T08:28:51.225Z] # list of conditions and the following disclaimer. Redistributions in binary
[2022-03-09T08:28:51.225Z] # form must reproduce the above copyright notice, this list of conditions and
[2022-03-09T08:28:51.225Z] # the following disclaimer in the documentation and/or other materials
[2022-03-09T08:28:51.225Z] # provided with the distribution.
[2022-03-09T08:28:51.225Z] #
[2022-03-09T08:28:51.225Z] # None of the names of the copyright holders may be used to endorse or
[2022-03-09T08:28:51.225Z] # promote products derived from this software without specific prior written
[2022-03-09T08:28:51.225Z] # permission.
[2022-03-09T08:28:51.225Z] #
[2022-03-09T08:28:51.225Z] # THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
[2022-03-09T08:28:51.225Z] # AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
[2022-03-09T08:28:51.225Z] # IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
[2022-03-09T08:28:51.225Z] # ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
[2022-03-09T08:28:51.225Z] # LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
[2022-03-09T08:28:51.225Z] # CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
[2022-03-09T08:28:51.225Z] # SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
[2022-03-09T08:28:51.225Z] # INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
[2022-03-09T08:28:51.225Z] # CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
[2022-03-09T08:28:51.225Z] # ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
[2022-03-09T08:28:51.225Z] # POSSIBILITY OF SUCH DAMAGE.
[2022-03-09T08:28:51.225Z] #******************************************************************************
[2022-03-09T08:28:51.225Z]
[2022-03-09T08:28:51.225Z] """
[2022-03-09T08:28:51.225Z] Direct wrappers for Fortran `id_dist` backend.
[2022-03-09T08:28:51.225Z] """
[2022-03-09T08:28:51.225Z]
[2022-03-09T08:28:51.225Z] > import scipy.linalg._interpolative as _id
[2022-03-09T08:28:51.225Z] E ImportError: /usr/lib/python3.10/site-packages/scipy/linalg/_interpolative.cpython-310-x86_64-linux-gnu.so: undefined symbol: _ZGVbN2v_sin
[2022-03-09T08:28:51.225Z]
[2022-03-09T08:28:51.225Z] /usr/lib/python3.10/site-packages/scipy/linalg/_interpolative_backend.py:34: ImportError
[2022-03-09T08:28:51.225Z] ___ TestDegreeMixingCorrelation.test_degree_pearson_assortativity_multigraph ___
[2022-03-09T08:28:51.225Z]
[2022-03-09T08:28:51.225Z] self = <networkx.algorithms.assortativity.tests.test_correlation.TestDegreeMixingCorrelation object at 0x7fe886143100>
[2022-03-09T08:28:51.225Z]
[2022-03-09T08:28:51.225Z] def test_degree_pearson_assortativity_multigraph(self):
[2022-03-09T08:28:51.225Z] > r = nx.degree_pearson_correlation_coefficient(self.M)
[2022-03-09T08:28:51.225Z]
[2022-03-09T08:28:51.225Z] networkx/algorithms/assortativity/tests/test_correlation.py:51:
[2022-03-09T08:28:51.225Z] _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
[2022-03-09T08:28:51.225Z] networkx/algorithms/assortativity/correlation.py:153: in degree_pearson_correlation_coefficient
[2022-03-09T08:28:51.225Z] import scipy.stats # call as sp.stats
[2022-03-09T08:28:51.225Z] /usr/lib/python3.10/site-packages/scipy/stats/__init__.py:453: in <module>
[2022-03-09T08:28:51.225Z] from ._stats_py import *
[2022-03-09T08:28:51.225Z] /usr/lib/python3.10/site-packages/scipy/stats/_stats_py.py:44: in <module>
[2022-03-09T08:28:51.225Z] from . import distributions
[2022-03-09T08:28:51.225Z] /usr/lib/python3.10/site-packages/scipy/stats/distributions.py:8: in <module>
[2022-03-09T08:28:51.225Z] from ._distn_infrastructure import (rv_discrete, rv_continuous, rv_frozen)
[2022-03-09T08:28:51.225Z] /usr/lib/python3.10/site-packages/scipy/stats/_distn_infrastructure.py:24: in <module>
[2022-03-09T08:28:51.225Z] from scipy import optimize
[2022-03-09T08:28:51.225Z] /usr/lib/python3.10/site-packages/scipy/optimize/__init__.py:412: in <module>
[2022-03-09T08:28:51.225Z] from ._linprog import linprog, linprog_verbose_callback
[2022-03-09T08:28:51.225Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog.py:23: in <module>
[2022-03-09T08:28:51.225Z] from ._linprog_ip import _linprog_ip
[2022-03-09T08:28:51.225Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog_ip.py:27: in <module>
[2022-03-09T08:28:51.225Z] from ._linprog_util import _postsolve
[2022-03-09T08:28:51.226Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog_util.py:9: in <module>
[2022-03-09T08:28:51.226Z] from scipy.optimize._remove_redundancy import (
[2022-03-09T08:28:51.226Z] /usr/lib/python3.10/site-packages/scipy/optimize/_remove_redundancy.py:9: in <module>
[2022-03-09T08:28:51.226Z] from scipy.linalg.interpolative import interp_decomp
[2022-03-09T08:28:51.226Z] /usr/lib/python3.10/site-packages/scipy/linalg/interpolative.py:385: in <module>
[2022-03-09T08:28:51.226Z] import scipy.linalg._interpolative_backend as _backend
[2022-03-09T08:28:51.226Z] _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
[2022-03-09T08:28:51.226Z]
[2022-03-09T08:28:51.226Z] #******************************************************************************
[2022-03-09T08:28:51.226Z] # Copyright (C) 2013 Kenneth L. Ho
[2022-03-09T08:28:51.226Z] #
[2022-03-09T08:28:51.226Z] # Redistribution and use in source and binary forms, with or without
[2022-03-09T08:28:51.226Z] # modification, are permitted provided that the following conditions are met:
[2022-03-09T08:28:51.226Z] #
[2022-03-09T08:28:51.226Z] # Redistributions of source code must retain the above copyright notice, this
[2022-03-09T08:28:51.226Z] # list of conditions and the following disclaimer. Redistributions in binary
[2022-03-09T08:28:51.226Z] # form must reproduce the above copyright notice, this list of conditions and
[2022-03-09T08:28:51.226Z] # the following disclaimer in the documentation and/or other materials
[2022-03-09T08:28:51.226Z] # provided with the distribution.
[2022-03-09T08:28:51.226Z] #
[2022-03-09T08:28:51.226Z] # None of the names of the copyright holders may be used to endorse or
[2022-03-09T08:28:51.226Z] # promote products derived from this software without specific prior written
[2022-03-09T08:28:51.226Z] # permission.
[2022-03-09T08:28:51.226Z] #
[2022-03-09T08:28:51.226Z] # THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
[2022-03-09T08:28:51.226Z] # AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
[2022-03-09T08:28:51.226Z] # IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
[2022-03-09T08:28:51.226Z] # ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
[2022-03-09T08:28:51.226Z] # LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
[2022-03-09T08:28:51.226Z] # CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
[2022-03-09T08:28:51.226Z] # SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
[2022-03-09T08:28:51.226Z] # INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
[2022-03-09T08:28:51.226Z] # CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
[2022-03-09T08:28:51.226Z] # ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
[2022-03-09T08:28:51.226Z] # POSSIBILITY OF SUCH DAMAGE.
[2022-03-09T08:28:51.226Z] #******************************************************************************
[2022-03-09T08:28:51.226Z]
[2022-03-09T08:28:51.226Z] """
[2022-03-09T08:28:51.226Z] Direct wrappers for Fortran `id_dist` backend.
[2022-03-09T08:28:51.226Z] """
[2022-03-09T08:28:51.226Z]
[2022-03-09T08:28:51.226Z] > import scipy.linalg._interpolative as _id
[2022-03-09T08:28:51.226Z] E ImportError: /usr/lib/python3.10/site-packages/scipy/linalg/_interpolative.cpython-310-x86_64-linux-gnu.so: undefined symbol: _ZGVbN2v_sin
[2022-03-09T08:28:51.226Z]
[2022-03-09T08:28:51.226Z] /usr/lib/python3.10/site-packages/scipy/linalg/_interpolative_backend.py:34: ImportError
[2022-03-09T08:28:51.226Z] _ TestMinimumWeightFullMatching.test_minimum_weight_full_matching_incomplete_graph _
[2022-03-09T08:28:51.226Z]
[2022-03-09T08:28:51.226Z] self = <networkx.algorithms.bipartite.tests.test_matching.TestMinimumWeightFullMatching object at 0x7fe885e24580>
[2022-03-09T08:28:51.226Z]
[2022-03-09T08:28:51.226Z] def test_minimum_weight_full_matching_incomplete_graph(self):
[2022-03-09T08:28:51.226Z] B = nx.Graph()
[2022-03-09T08:28:51.226Z] B.add_nodes_from([1, 2], bipartite=0)
[2022-03-09T08:28:51.226Z] B.add_nodes_from([3, 4], bipartite=1)
[2022-03-09T08:28:51.226Z] B.add_edge(1, 4, weight=100)
[2022-03-09T08:28:51.226Z] B.add_edge(2, 3, weight=100)
[2022-03-09T08:28:51.226Z] B.add_edge(2, 4, weight=50)
[2022-03-09T08:28:51.226Z] > matching = minimum_weight_full_matching(B)
[2022-03-09T08:28:51.226Z]
[2022-03-09T08:28:51.226Z] networkx/algorithms/bipartite/tests/test_matching.py:229:
[2022-03-09T08:28:51.226Z] _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
[2022-03-09T08:28:51.226Z] networkx/algorithms/bipartite/matching.py:561: in minimum_weight_full_matching
[2022-03-09T08:28:51.226Z] import scipy.optimize # call as sp.optimize
[2022-03-09T08:28:51.226Z] /usr/lib/python3.10/site-packages/scipy/optimize/__init__.py:412: in <module>
[2022-03-09T08:28:51.227Z] from ._linprog import linprog, linprog_verbose_callback
[2022-03-09T08:28:51.227Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog.py:23: in <module>
[2022-03-09T08:28:51.227Z] from ._linprog_ip import _linprog_ip
[2022-03-09T08:28:51.227Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog_ip.py:27: in <module>
[2022-03-09T08:28:51.227Z] from ._linprog_util import _postsolve
[2022-03-09T08:28:51.227Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog_util.py:9: in <module>
[2022-03-09T08:28:51.227Z] from scipy.optimize._remove_redundancy import (
[2022-03-09T08:28:51.227Z] /usr/lib/python3.10/site-packages/scipy/optimize/_remove_redundancy.py:9: in <module>
[2022-03-09T08:28:51.227Z] from scipy.linalg.interpolative import interp_decomp
[2022-03-09T08:28:51.227Z] /usr/lib/python3.10/site-packages/scipy/linalg/interpolative.py:385: in <module>
[2022-03-09T08:28:51.227Z] import scipy.linalg._interpolative_backend as _backend
[2022-03-09T08:28:51.227Z] _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
[2022-03-09T08:28:51.227Z]
[2022-03-09T08:28:51.227Z] #******************************************************************************
[2022-03-09T08:28:51.227Z] # Copyright (C) 2013 Kenneth L. Ho
[2022-03-09T08:28:51.227Z] #
[2022-03-09T08:28:51.227Z] # Redistribution and use in source and binary forms, with or without
[2022-03-09T08:28:51.227Z] # modification, are permitted provided that the following conditions are met:
[2022-03-09T08:28:51.227Z] #
[2022-03-09T08:28:51.227Z] # Redistributions of source code must retain the above copyright notice, this
[2022-03-09T08:28:51.227Z] # list of conditions and the following disclaimer. Redistributions in binary
[2022-03-09T08:28:51.227Z] # form must reproduce the above copyright notice, this list of conditions and
[2022-03-09T08:28:51.227Z] # the following disclaimer in the documentation and/or other materials
[2022-03-09T08:28:51.227Z] # provided with the distribution.
[2022-03-09T08:28:51.227Z] #
[2022-03-09T08:28:51.227Z] # None of the names of the copyright holders may be used to endorse or
[2022-03-09T08:28:51.227Z] # promote products derived from this software without specific prior written
[2022-03-09T08:28:51.227Z] # permission.
[2022-03-09T08:28:51.227Z] #
[2022-03-09T08:28:51.227Z] # THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
[2022-03-09T08:28:51.227Z] # AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
[2022-03-09T08:28:51.227Z] # IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
[2022-03-09T08:28:51.227Z] # ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
[2022-03-09T08:28:51.227Z] # LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
[2022-03-09T08:28:51.227Z] # CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
[2022-03-09T08:28:51.227Z] # SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
[2022-03-09T08:28:51.227Z] # INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
[2022-03-09T08:28:51.227Z] # CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
[2022-03-09T08:28:51.227Z] # ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
[2022-03-09T08:28:51.227Z] # POSSIBILITY OF SUCH DAMAGE.
[2022-03-09T08:28:51.227Z] #******************************************************************************
[2022-03-09T08:28:51.227Z]
[2022-03-09T08:28:51.227Z] """
[2022-03-09T08:28:51.227Z] Direct wrappers for Fortran `id_dist` backend.
[2022-03-09T08:28:51.227Z] """
[2022-03-09T08:28:51.227Z]
[2022-03-09T08:28:51.227Z] > import scipy.linalg._interpolative as _id
[2022-03-09T08:28:51.227Z] E ImportError: /usr/lib/python3.10/site-packages/scipy/linalg/_interpolative.cpython-310-x86_64-linux-gnu.so: undefined symbol: _ZGVbN2v_sin
[2022-03-09T08:28:51.227Z]
[2022-03-09T08:28:51.227Z] /usr/lib/python3.10/site-packages/scipy/linalg/_interpolative_backend.py:34: ImportError
[2022-03-09T08:28:51.227Z] _ TestMinimumWeightFullMatching.test_minimum_weight_full_matching_with_no_full_matching _
[2022-03-09T08:28:51.227Z]
[2022-03-09T08:28:51.227Z] self = <networkx.algorithms.bipartite.tests.test_matching.TestMinimumWeightFullMatching object at 0x7fe88629ed10>
[2022-03-09T08:28:51.227Z]
[2022-03-09T08:28:51.227Z] def test_minimum_weight_full_matching_with_no_full_matching(self):
[2022-03-09T08:28:51.227Z] B = nx.Graph()
[2022-03-09T08:28:51.227Z] B.add_nodes_from([1, 2, 3], bipartite=0)
[2022-03-09T08:28:51.227Z] B.add_nodes_from([4, 5, 6], bipartite=1)
[2022-03-09T08:28:51.227Z] B.add_edge(1, 4, weight=100)
[2022-03-09T08:28:51.227Z] B.add_edge(2, 4, weight=100)
[2022-03-09T08:28:51.227Z] B.add_edge(3, 4, weight=50)
[2022-03-09T08:28:51.227Z] B.add_edge(3, 5, weight=50)
[2022-03-09T08:28:51.227Z] B.add_edge(3, 6, weight=50)
[2022-03-09T08:28:51.227Z] with pytest.raises(ValueError):
[2022-03-09T08:28:51.227Z] > minimum_weight_full_matching(B)
[2022-03-09T08:28:51.227Z]
[2022-03-09T08:28:51.227Z] networkx/algorithms/bipartite/tests/test_matching.py:242:
[2022-03-09T08:28:51.227Z] _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
[2022-03-09T08:28:51.227Z] networkx/algorithms/bipartite/matching.py:561: in minimum_weight_full_matching
[2022-03-09T08:28:51.227Z] import scipy.optimize # call as sp.optimize
[2022-03-09T08:28:51.227Z] /usr/lib/python3.10/site-packages/scipy/optimize/__init__.py:412: in <module>
[2022-03-09T08:28:51.227Z] from ._linprog import linprog, linprog_verbose_callback
[2022-03-09T08:28:51.227Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog.py:23: in <module>
[2022-03-09T08:28:51.228Z] from ._linprog_ip import _linprog_ip
[2022-03-09T08:28:51.228Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog_ip.py:27: in <module>
[2022-03-09T08:28:51.228Z] from ._linprog_util import _postsolve
[2022-03-09T08:28:51.228Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog_util.py:9: in <module>
[2022-03-09T08:28:51.228Z] from scipy.optimize._remove_redundancy import (
[2022-03-09T08:28:51.228Z] /usr/lib/python3.10/site-packages/scipy/optimize/_remove_redundancy.py:9: in <module>
[2022-03-09T08:28:51.228Z] from scipy.linalg.interpolative import interp_decomp
[2022-03-09T08:28:51.228Z] /usr/lib/python3.10/site-packages/scipy/linalg/interpolative.py:385: in <module>
[2022-03-09T08:28:51.228Z] import scipy.linalg._interpolative_backend as _backend
[2022-03-09T08:28:51.228Z] _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
[2022-03-09T08:28:51.228Z]
[2022-03-09T08:28:51.228Z] #******************************************************************************
[2022-03-09T08:28:51.228Z] # Copyright (C) 2013 Kenneth L. Ho
[2022-03-09T08:28:51.228Z] #
[2022-03-09T08:28:51.228Z] # Redistribution and use in source and binary forms, with or without
[2022-03-09T08:28:51.228Z] # modification, are permitted provided that the following conditions are met:
[2022-03-09T08:28:51.228Z] #
[2022-03-09T08:28:51.228Z] # Redistributions of source code must retain the above copyright notice, this
[2022-03-09T08:28:51.228Z] # list of conditions and the following disclaimer. Redistributions in binary
[2022-03-09T08:28:51.228Z] # form must reproduce the above copyright notice, this list of conditions and
[2022-03-09T08:28:51.228Z] # the following disclaimer in the documentation and/or other materials
[2022-03-09T08:28:51.228Z] # provided with the distribution.
[2022-03-09T08:28:51.228Z] #
[2022-03-09T08:28:51.228Z] # None of the names of the copyright holders may be used to endorse or
[2022-03-09T08:28:51.228Z] # promote products derived from this software without specific prior written
[2022-03-09T08:28:51.228Z] # permission.
[2022-03-09T08:28:51.228Z] #
[2022-03-09T08:28:51.228Z] # THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
[2022-03-09T08:28:51.228Z] # AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
[2022-03-09T08:28:51.228Z] # IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
[2022-03-09T08:28:51.228Z] # ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
[2022-03-09T08:28:51.228Z] # LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
[2022-03-09T08:28:51.228Z] # CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
[2022-03-09T08:28:51.228Z] # SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
[2022-03-09T08:28:51.228Z] # INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
[2022-03-09T08:28:51.228Z] # CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
[2022-03-09T08:28:51.228Z] # ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
[2022-03-09T08:28:51.228Z] # POSSIBILITY OF SUCH DAMAGE.
[2022-03-09T08:28:51.228Z] #******************************************************************************
[2022-03-09T08:28:51.228Z]
[2022-03-09T08:28:51.228Z] """
[2022-03-09T08:28:51.228Z] Direct wrappers for Fortran `id_dist` backend.
[2022-03-09T08:28:51.228Z] """
[2022-03-09T08:28:51.228Z]
[2022-03-09T08:28:51.228Z] > import scipy.linalg._interpolative as _id
[2022-03-09T08:28:51.228Z] E ImportError: /usr/lib/python3.10/site-packages/scipy/linalg/_interpolative.cpython-310-x86_64-linux-gnu.so: undefined symbol: _ZGVbN2v_sin
[2022-03-09T08:28:51.228Z]
[2022-03-09T08:28:51.228Z] /usr/lib/python3.10/site-packages/scipy/linalg/_interpolative_backend.py:34: ImportError
[2022-03-09T08:28:51.228Z] ____ TestMinimumWeightFullMatching.test_minimum_weight_full_matching_square ____
[2022-03-09T08:28:51.228Z]
[2022-03-09T08:28:51.228Z] self = <networkx.algorithms.bipartite.tests.test_matching.TestMinimumWeightFullMatching object at 0x7fe88628ecb0>
[2022-03-09T08:28:51.228Z]
[2022-03-09T08:28:51.228Z] def test_minimum_weight_full_matching_square(self):
[2022-03-09T08:28:51.228Z] G = nx.complete_bipartite_graph(3, 3)
[2022-03-09T08:28:51.228Z] G.add_edge(0, 3, weight=400)
[2022-03-09T08:28:51.228Z] G.add_edge(0, 4, weight=150)
[2022-03-09T08:28:51.228Z] G.add_edge(0, 5, weight=400)
[2022-03-09T08:28:51.228Z] G.add_edge(1, 3, weight=400)
[2022-03-09T08:28:51.228Z] G.add_edge(1, 4, weight=450)
[2022-03-09T08:28:51.228Z] G.add_edge(1, 5, weight=600)
[2022-03-09T08:28:51.228Z] G.add_edge(2, 3, weight=300)
[2022-03-09T08:28:51.228Z] G.add_edge(2, 4, weight=225)
[2022-03-09T08:28:51.228Z] G.add_edge(2, 5, weight=300)
[2022-03-09T08:28:51.228Z] > matching = minimum_weight_full_matching(G)
[2022-03-09T08:28:51.228Z]
[2022-03-09T08:28:51.228Z] networkx/algorithms/bipartite/tests/test_matching.py:255:
[2022-03-09T08:28:51.228Z] _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
[2022-03-09T08:28:51.228Z] networkx/algorithms/bipartite/matching.py:561: in minimum_weight_full_matching
[2022-03-09T08:28:51.228Z] import scipy.optimize # call as sp.optimize
[2022-03-09T08:28:51.228Z] /usr/lib/python3.10/site-packages/scipy/optimize/__init__.py:412: in <module>
[2022-03-09T08:28:51.228Z] from ._linprog import linprog, linprog_verbose_callback
[2022-03-09T08:28:51.228Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog.py:23: in <module>
[2022-03-09T08:28:51.228Z] from ._linprog_ip import _linprog_ip
[2022-03-09T08:28:51.228Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog_ip.py:27: in <module>
[2022-03-09T08:28:51.229Z] from ._linprog_util import _postsolve
[2022-03-09T08:28:51.229Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog_util.py:9: in <module>
[2022-03-09T08:28:51.229Z] from scipy.optimize._remove_redundancy import (
[2022-03-09T08:28:51.229Z] /usr/lib/python3.10/site-packages/scipy/optimize/_remove_redundancy.py:9: in <module>
[2022-03-09T08:28:51.229Z] from scipy.linalg.interpolative import interp_decomp
[2022-03-09T08:28:51.229Z] /usr/lib/python3.10/site-packages/scipy/linalg/interpolative.py:385: in <module>
[2022-03-09T08:28:51.229Z] import scipy.linalg._interpolative_backend as _backend
[2022-03-09T08:28:51.229Z] _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
[2022-03-09T08:28:51.229Z]
[2022-03-09T08:28:51.229Z] #******************************************************************************
[2022-03-09T08:28:51.229Z] # Copyright (C) 2013 Kenneth L. Ho
[2022-03-09T08:28:51.229Z] #
[2022-03-09T08:28:51.229Z] # Redistribution and use in source and binary forms, with or without
[2022-03-09T08:28:51.229Z] # modification, are permitted provided that the following conditions are met:
[2022-03-09T08:28:51.229Z] #
[2022-03-09T08:28:51.229Z] # Redistributions of source code must retain the above copyright notice, this
[2022-03-09T08:28:51.229Z] # list of conditions and the following disclaimer. Redistributions in binary
[2022-03-09T08:28:51.229Z] # form must reproduce the above copyright notice, this list of conditions and
[2022-03-09T08:28:51.229Z] # the following disclaimer in the documentation and/or other materials
[2022-03-09T08:28:51.229Z] # provided with the distribution.
[2022-03-09T08:28:51.229Z] #
[2022-03-09T08:28:51.229Z] # None of the names of the copyright holders may be used to endorse or
[2022-03-09T08:28:51.229Z] # promote products derived from this software without specific prior written
[2022-03-09T08:28:51.229Z] # permission.
[2022-03-09T08:28:51.229Z] #
[2022-03-09T08:28:51.229Z] # THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
[2022-03-09T08:28:51.229Z] # AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
[2022-03-09T08:28:51.229Z] # IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
[2022-03-09T08:28:51.229Z] # ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
[2022-03-09T08:28:51.229Z] # LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
[2022-03-09T08:28:51.229Z] # CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
[2022-03-09T08:28:51.229Z] # SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
[2022-03-09T08:28:51.229Z] # INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
[2022-03-09T08:28:51.229Z] # CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
[2022-03-09T08:28:51.229Z] # ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
[2022-03-09T08:28:51.229Z] # POSSIBILITY OF SUCH DAMAGE.
[2022-03-09T08:28:51.229Z] #******************************************************************************
[2022-03-09T08:28:51.229Z]
[2022-03-09T08:28:51.229Z] """
[2022-03-09T08:28:51.229Z] Direct wrappers for Fortran `id_dist` backend.
[2022-03-09T08:28:51.229Z] """
[2022-03-09T08:28:51.229Z]
[2022-03-09T08:28:51.229Z] > import scipy.linalg._interpolative as _id
[2022-03-09T08:28:51.229Z] E ImportError: /usr/lib/python3.10/site-packages/scipy/linalg/_interpolative.cpython-310-x86_64-linux-gnu.so: undefined symbol: _ZGVbN2v_sin
[2022-03-09T08:28:51.229Z]
[2022-03-09T08:28:51.229Z] /usr/lib/python3.10/site-packages/scipy/linalg/_interpolative_backend.py:34: ImportError
[2022-03-09T08:28:51.229Z] _ TestMinimumWeightFullMatching.test_minimum_weight_full_matching_smaller_left _
[2022-03-09T08:28:51.229Z]
[2022-03-09T08:28:51.229Z] self = <networkx.algorithms.bipartite.tests.test_matching.TestMinimumWeightFullMatching object at 0x7fe88628ce80>
[2022-03-09T08:28:51.229Z]
[2022-03-09T08:28:51.229Z] def test_minimum_weight_full_matching_smaller_left(self):
[2022-03-09T08:28:51.229Z] G = nx.complete_bipartite_graph(3, 4)
[2022-03-09T08:28:51.229Z] G.add_edge(0, 3, weight=400)
[2022-03-09T08:28:51.229Z] G.add_edge(0, 4, weight=150)
[2022-03-09T08:28:51.229Z] G.add_edge(0, 5, weight=400)
[2022-03-09T08:28:51.229Z] G.add_edge(0, 6, weight=1)
[2022-03-09T08:28:51.229Z] G.add_edge(1, 3, weight=400)
[2022-03-09T08:28:51.229Z] G.add_edge(1, 4, weight=450)
[2022-03-09T08:28:51.229Z] G.add_edge(1, 5, weight=600)
[2022-03-09T08:28:51.229Z] G.add_edge(1, 6, weight=2)
[2022-03-09T08:28:51.229Z] G.add_edge(2, 3, weight=300)
[2022-03-09T08:28:51.229Z] G.add_edge(2, 4, weight=225)
[2022-03-09T08:28:51.229Z] G.add_edge(2, 5, weight=290)
[2022-03-09T08:28:51.229Z] G.add_edge(2, 6, weight=3)
[2022-03-09T08:28:51.229Z] > matching = minimum_weight_full_matching(G)
[2022-03-09T08:28:51.229Z]
[2022-03-09T08:28:51.229Z] networkx/algorithms/bipartite/tests/test_matching.py:272:
[2022-03-09T08:28:51.229Z] _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
[2022-03-09T08:28:51.229Z] networkx/algorithms/bipartite/matching.py:561: in minimum_weight_full_matching
[2022-03-09T08:28:51.229Z] import scipy.optimize # call as sp.optimize
[2022-03-09T08:28:51.229Z] /usr/lib/python3.10/site-packages/scipy/optimize/__init__.py:412: in <module>
[2022-03-09T08:28:51.230Z] from ._linprog import linprog, linprog_verbose_callback
[2022-03-09T08:28:51.230Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog.py:23: in <module>
[2022-03-09T08:28:51.230Z] from ._linprog_ip import _linprog_ip
[2022-03-09T08:28:51.230Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog_ip.py:27: in <module>
[2022-03-09T08:28:51.230Z] from ._linprog_util import _postsolve
[2022-03-09T08:28:51.230Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog_util.py:9: in <module>
[2022-03-09T08:28:51.230Z] from scipy.optimize._remove_redundancy import (
[2022-03-09T08:28:51.230Z] /usr/lib/python3.10/site-packages/scipy/optimize/_remove_redundancy.py:9: in <module>
[2022-03-09T08:28:51.230Z] from scipy.linalg.interpolative import interp_decomp
[2022-03-09T08:28:51.230Z] /usr/lib/python3.10/site-packages/scipy/linalg/interpolative.py:385: in <module>
[2022-03-09T08:28:51.230Z] import scipy.linalg._interpolative_backend as _backend
[2022-03-09T08:28:51.230Z] _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
[2022-03-09T08:28:51.230Z]
[2022-03-09T08:28:51.230Z] #******************************************************************************
[2022-03-09T08:28:51.230Z] # Copyright (C) 2013 Kenneth L. Ho
[2022-03-09T08:28:51.230Z] #
[2022-03-09T08:28:51.230Z] # Redistribution and use in source and binary forms, with or without
[2022-03-09T08:28:51.230Z] # modification, are permitted provided that the following conditions are met:
[2022-03-09T08:28:51.230Z] #
[2022-03-09T08:28:51.230Z] # Redistributions of source code must retain the above copyright notice, this
[2022-03-09T08:28:51.230Z] # list of conditions and the following disclaimer. Redistributions in binary
[2022-03-09T08:28:51.230Z] # form must reproduce the above copyright notice, this list of conditions and
[2022-03-09T08:28:51.230Z] # the following disclaimer in the documentation and/or other materials
[2022-03-09T08:28:51.230Z] # provided with the distribution.
[2022-03-09T08:28:51.230Z] #
[2022-03-09T08:28:51.230Z] # None of the names of the copyright holders may be used to endorse or
[2022-03-09T08:28:51.230Z] # promote products derived from this software without specific prior written
[2022-03-09T08:28:51.230Z] # permission.
[2022-03-09T08:28:51.230Z] #
[2022-03-09T08:28:51.230Z] # THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
[2022-03-09T08:28:51.230Z] # AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
[2022-03-09T08:28:51.230Z] # IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
[2022-03-09T08:28:51.230Z] # ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
[2022-03-09T08:28:51.230Z] # LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
[2022-03-09T08:28:51.230Z] # CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
[2022-03-09T08:28:51.230Z] # SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
[2022-03-09T08:28:51.230Z] # INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
[2022-03-09T08:28:51.230Z] # CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
[2022-03-09T08:28:51.230Z] # ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
[2022-03-09T08:28:51.230Z] # POSSIBILITY OF SUCH DAMAGE.
[2022-03-09T08:28:51.230Z] #******************************************************************************
[2022-03-09T08:28:51.230Z]
[2022-03-09T08:28:51.230Z] """
[2022-03-09T08:28:51.230Z] Direct wrappers for Fortran `id_dist` backend.
[2022-03-09T08:28:51.230Z] """
[2022-03-09T08:28:51.230Z]
[2022-03-09T08:28:51.230Z] > import scipy.linalg._interpolative as _id
[2022-03-09T08:28:51.230Z] E ImportError: /usr/lib/python3.10/site-packages/scipy/linalg/_interpolative.cpython-310-x86_64-linux-gnu.so: undefined symbol: _ZGVbN2v_sin
[2022-03-09T08:28:51.230Z]
[2022-03-09T08:28:51.230Z] /usr/lib/python3.10/site-packages/scipy/linalg/_interpolative_backend.py:34: ImportError
[2022-03-09T08:28:51.230Z] _ TestMinimumWeightFullMatching.test_minimum_weight_full_matching_smaller_top_nodes_right _
[2022-03-09T08:28:51.230Z]
[2022-03-09T08:28:51.230Z] self = <networkx.algorithms.bipartite.tests.test_matching.TestMinimumWeightFullMatching object at 0x7fe885e24340>
[2022-03-09T08:28:51.230Z]
[2022-03-09T08:28:51.230Z] def test_minimum_weight_full_matching_smaller_top_nodes_right(self):
[2022-03-09T08:28:51.230Z] G = nx.complete_bipartite_graph(3, 4)
[2022-03-09T08:28:51.230Z] G.add_edge(0, 3, weight=400)
[2022-03-09T08:28:51.230Z] G.add_edge(0, 4, weight=150)
[2022-03-09T08:28:51.230Z] G.add_edge(0, 5, weight=400)
[2022-03-09T08:28:51.230Z] G.add_edge(0, 6, weight=1)
[2022-03-09T08:28:51.230Z] G.add_edge(1, 3, weight=400)
[2022-03-09T08:28:51.230Z] G.add_edge(1, 4, weight=450)
[2022-03-09T08:28:51.230Z] G.add_edge(1, 5, weight=600)
[2022-03-09T08:28:51.230Z] G.add_edge(1, 6, weight=2)
[2022-03-09T08:28:51.230Z] G.add_edge(2, 3, weight=300)
[2022-03-09T08:28:51.230Z] G.add_edge(2, 4, weight=225)
[2022-03-09T08:28:51.230Z] G.add_edge(2, 5, weight=290)
[2022-03-09T08:28:51.230Z] G.add_edge(2, 6, weight=3)
[2022-03-09T08:28:51.230Z] > matching = minimum_weight_full_matching(G, top_nodes=[3, 4, 5, 6])
[2022-03-09T08:28:51.230Z]
[2022-03-09T08:28:51.230Z] networkx/algorithms/bipartite/tests/test_matching.py:289:
[2022-03-09T08:28:51.230Z] _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
[2022-03-09T08:28:51.230Z] networkx/algorithms/bipartite/matching.py:561: in minimum_weight_full_matching
[2022-03-09T08:28:51.230Z] import scipy.optimize # call as sp.optimize
[2022-03-09T08:28:51.230Z] /usr/lib/python3.10/site-packages/scipy/optimize/__init__.py:412: in <module>
[2022-03-09T08:28:51.231Z] from ._linprog import linprog, linprog_verbose_callback
[2022-03-09T08:28:51.231Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog.py:23: in <module>
[2022-03-09T08:28:51.231Z] from ._linprog_ip import _linprog_ip
[2022-03-09T08:28:51.231Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog_ip.py:27: in <module>
[2022-03-09T08:28:51.231Z] from ._linprog_util import _postsolve
[2022-03-09T08:28:51.231Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog_util.py:9: in <module>
[2022-03-09T08:28:51.231Z] from scipy.optimize._remove_redundancy import (
[2022-03-09T08:28:51.231Z] /usr/lib/python3.10/site-packages/scipy/optimize/_remove_redundancy.py:9: in <module>
[2022-03-09T08:28:51.231Z] from scipy.linalg.interpolative import interp_decomp
[2022-03-09T08:28:51.231Z] /usr/lib/python3.10/site-packages/scipy/linalg/interpolative.py:385: in <module>
[2022-03-09T08:28:51.231Z] import scipy.linalg._interpolative_backend as _backend
[2022-03-09T08:28:51.231Z] _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
[2022-03-09T08:28:51.231Z]
[2022-03-09T08:28:51.231Z] #******************************************************************************
[2022-03-09T08:28:51.231Z] # Copyright (C) 2013 Kenneth L. Ho
[2022-03-09T08:28:51.231Z] #
[2022-03-09T08:28:51.231Z] # Redistribution and use in source and binary forms, with or without
[2022-03-09T08:28:51.231Z] # modification, are permitted provided that the following conditions are met:
[2022-03-09T08:28:51.231Z] #
[2022-03-09T08:28:51.231Z] # Redistributions of source code must retain the above copyright notice, this
[2022-03-09T08:28:51.231Z] # list of conditions and the following disclaimer. Redistributions in binary
[2022-03-09T08:28:51.231Z] # form must reproduce the above copyright notice, this list of conditions and
[2022-03-09T08:28:51.231Z] # the following disclaimer in the documentation and/or other materials
[2022-03-09T08:28:51.231Z] # provided with the distribution.
[2022-03-09T08:28:51.231Z] #
[2022-03-09T08:28:51.231Z] # None of the names of the copyright holders may be used to endorse or
[2022-03-09T08:28:51.231Z] # promote products derived from this software without specific prior written
[2022-03-09T08:28:51.231Z] # permission.
[2022-03-09T08:28:51.231Z] #
[2022-03-09T08:28:51.231Z] # THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
[2022-03-09T08:28:51.231Z] # AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
[2022-03-09T08:28:51.231Z] # IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
[2022-03-09T08:28:51.231Z] # ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
[2022-03-09T08:28:51.231Z] # LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
[2022-03-09T08:28:51.231Z] # CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
[2022-03-09T08:28:51.231Z] # SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
[2022-03-09T08:28:51.231Z] # INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
[2022-03-09T08:28:51.231Z] # CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
[2022-03-09T08:28:51.231Z] # ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
[2022-03-09T08:28:51.231Z] # POSSIBILITY OF SUCH DAMAGE.
[2022-03-09T08:28:51.231Z] #******************************************************************************
[2022-03-09T08:28:51.231Z]
[2022-03-09T08:28:51.231Z] """
[2022-03-09T08:28:51.231Z] Direct wrappers for Fortran `id_dist` backend.
[2022-03-09T08:28:51.231Z] """
[2022-03-09T08:28:51.231Z]
[2022-03-09T08:28:51.231Z] > import scipy.linalg._interpolative as _id
[2022-03-09T08:28:51.231Z] E ImportError: /usr/lib/python3.10/site-packages/scipy/linalg/_interpolative.cpython-310-x86_64-linux-gnu.so: undefined symbol: _ZGVbN2v_sin
[2022-03-09T08:28:51.231Z]
[2022-03-09T08:28:51.231Z] /usr/lib/python3.10/site-packages/scipy/linalg/_interpolative_backend.py:34: ImportError
[2022-03-09T08:28:51.231Z] _ TestMinimumWeightFullMatching.test_minimum_weight_full_matching_smaller_right _
[2022-03-09T08:28:51.231Z]
[2022-03-09T08:28:51.231Z] self = <networkx.algorithms.bipartite.tests.test_matching.TestMinimumWeightFullMatching object at 0x7fe885e24550>
[2022-03-09T08:28:51.231Z]
[2022-03-09T08:28:51.231Z] def test_minimum_weight_full_matching_smaller_right(self):
[2022-03-09T08:28:51.231Z] G = nx.complete_bipartite_graph(4, 3)
[2022-03-09T08:28:51.231Z] G.add_edge(0, 4, weight=400)
[2022-03-09T08:28:51.231Z] G.add_edge(0, 5, weight=400)
[2022-03-09T08:28:51.231Z] G.add_edge(0, 6, weight=300)
[2022-03-09T08:28:51.231Z] G.add_edge(1, 4, weight=150)
[2022-03-09T08:28:51.231Z] G.add_edge(1, 5, weight=450)
[2022-03-09T08:28:51.231Z] G.add_edge(1, 6, weight=225)
[2022-03-09T08:28:51.231Z] G.add_edge(2, 4, weight=400)
[2022-03-09T08:28:51.231Z] G.add_edge(2, 5, weight=600)
[2022-03-09T08:28:51.231Z] G.add_edge(2, 6, weight=290)
[2022-03-09T08:28:51.231Z] G.add_edge(3, 4, weight=1)
[2022-03-09T08:28:51.231Z] G.add_edge(3, 5, weight=2)
[2022-03-09T08:28:51.231Z] G.add_edge(3, 6, weight=3)
[2022-03-09T08:28:51.231Z] > matching = minimum_weight_full_matching(G)
[2022-03-09T08:28:51.231Z]
[2022-03-09T08:28:51.231Z] networkx/algorithms/bipartite/tests/test_matching.py:306:
[2022-03-09T08:28:51.231Z] _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
[2022-03-09T08:28:51.231Z] networkx/algorithms/bipartite/matching.py:561: in minimum_weight_full_matching
[2022-03-09T08:28:51.231Z] import scipy.optimize # call as sp.optimize
[2022-03-09T08:28:51.231Z] /usr/lib/python3.10/site-packages/scipy/optimize/__init__.py:412: in <module>
[2022-03-09T08:28:51.232Z] from ._linprog import linprog, linprog_verbose_callback
[2022-03-09T08:28:51.232Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog.py:23: in <module>
[2022-03-09T08:28:51.232Z] from ._linprog_ip import _linprog_ip
[2022-03-09T08:28:51.232Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog_ip.py:27: in <module>
[2022-03-09T08:28:51.232Z] from ._linprog_util import _postsolve
[2022-03-09T08:28:51.232Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog_util.py:9: in <module>
[2022-03-09T08:28:51.232Z] from scipy.optimize._remove_redundancy import (
[2022-03-09T08:28:51.232Z] /usr/lib/python3.10/site-packages/scipy/optimize/_remove_redundancy.py:9: in <module>
[2022-03-09T08:28:51.232Z] from scipy.linalg.interpolative import interp_decomp
[2022-03-09T08:28:51.232Z] /usr/lib/python3.10/site-packages/scipy/linalg/interpolative.py:385: in <module>
[2022-03-09T08:28:51.232Z] import scipy.linalg._interpolative_backend as _backend
[2022-03-09T08:28:51.232Z] _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
[2022-03-09T08:28:51.232Z]
[2022-03-09T08:28:51.232Z] #******************************************************************************
[2022-03-09T08:28:51.232Z] # Copyright (C) 2013 Kenneth L. Ho
[2022-03-09T08:28:51.232Z] #
[2022-03-09T08:28:51.232Z] # Redistribution and use in source and binary forms, with or without
[2022-03-09T08:28:51.232Z] # modification, are permitted provided that the following conditions are met:
[2022-03-09T08:28:51.232Z] #
[2022-03-09T08:28:51.232Z] # Redistributions of source code must retain the above copyright notice, this
[2022-03-09T08:28:51.232Z] # list of conditions and the following disclaimer. Redistributions in binary
[2022-03-09T08:28:51.232Z] # form must reproduce the above copyright notice, this list of conditions and
[2022-03-09T08:28:51.232Z] # the following disclaimer in the documentation and/or other materials
[2022-03-09T08:28:51.232Z] # provided with the distribution.
[2022-03-09T08:28:51.232Z] #
[2022-03-09T08:28:51.232Z] # None of the names of the copyright holders may be used to endorse or
[2022-03-09T08:28:51.232Z] # promote products derived from this software without specific prior written
[2022-03-09T08:28:51.232Z] # permission.
[2022-03-09T08:28:51.232Z] #
[2022-03-09T08:28:51.232Z] # THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
[2022-03-09T08:28:51.232Z] # AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
[2022-03-09T08:28:51.232Z] # IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
[2022-03-09T08:28:51.232Z] # ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
[2022-03-09T08:28:51.232Z] # LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
[2022-03-09T08:28:51.232Z] # CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
[2022-03-09T08:28:51.232Z] # SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
[2022-03-09T08:28:51.232Z] # INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
[2022-03-09T08:28:51.232Z] # CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
[2022-03-09T08:28:51.232Z] # ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
[2022-03-09T08:28:51.232Z] # POSSIBILITY OF SUCH DAMAGE.
[2022-03-09T08:28:51.232Z] #******************************************************************************
[2022-03-09T08:28:51.232Z]
[2022-03-09T08:28:51.232Z] """
[2022-03-09T08:28:51.232Z] Direct wrappers for Fortran `id_dist` backend.
[2022-03-09T08:28:51.232Z] """
[2022-03-09T08:28:51.232Z]
[2022-03-09T08:28:51.232Z] > import scipy.linalg._interpolative as _id
[2022-03-09T08:28:51.232Z] E ImportError: /usr/lib/python3.10/site-packages/scipy/linalg/_interpolative.cpython-310-x86_64-linux-gnu.so: undefined symbol: _ZGVbN2v_sin
[2022-03-09T08:28:51.232Z]
[2022-03-09T08:28:51.232Z] /usr/lib/python3.10/site-packages/scipy/linalg/_interpolative_backend.py:34: ImportError
[2022-03-09T08:28:51.232Z] _ TestMinimumWeightFullMatching.test_minimum_weight_full_matching_negative_weights _
[2022-03-09T08:28:51.232Z]
[2022-03-09T08:28:51.232Z] self = <networkx.algorithms.bipartite.tests.test_matching.TestMinimumWeightFullMatching object at 0x7fe885e243a0>
[2022-03-09T08:28:51.232Z]
[2022-03-09T08:28:51.232Z] def test_minimum_weight_full_matching_negative_weights(self):
[2022-03-09T08:28:51.232Z] G = nx.complete_bipartite_graph(2, 2)
[2022-03-09T08:28:51.232Z] G.add_edge(0, 2, weight=-2)
[2022-03-09T08:28:51.232Z] G.add_edge(0, 3, weight=0.2)
[2022-03-09T08:28:51.232Z] G.add_edge(1, 2, weight=-2)
[2022-03-09T08:28:51.232Z] G.add_edge(1, 3, weight=0.3)
[2022-03-09T08:28:51.232Z] > matching = minimum_weight_full_matching(G)
[2022-03-09T08:28:51.232Z]
[2022-03-09T08:28:51.232Z] networkx/algorithms/bipartite/tests/test_matching.py:315:
[2022-03-09T08:28:51.232Z] _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
[2022-03-09T08:28:51.232Z] networkx/algorithms/bipartite/matching.py:561: in minimum_weight_full_matching
[2022-03-09T08:28:51.232Z] import scipy.optimize # call as sp.optimize
[2022-03-09T08:28:51.232Z] /usr/lib/python3.10/site-packages/scipy/optimize/__init__.py:412: in <module>
[2022-03-09T08:28:51.232Z] from ._linprog import linprog, linprog_verbose_callback
[2022-03-09T08:28:51.232Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog.py:23: in <module>
[2022-03-09T08:28:51.232Z] from ._linprog_ip import _linprog_ip
[2022-03-09T08:28:51.232Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog_ip.py:27: in <module>
[2022-03-09T08:28:51.232Z] from ._linprog_util import _postsolve
[2022-03-09T08:28:51.233Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog_util.py:9: in <module>
[2022-03-09T08:28:51.233Z] from scipy.optimize._remove_redundancy import (
[2022-03-09T08:28:51.233Z] /usr/lib/python3.10/site-packages/scipy/optimize/_remove_redundancy.py:9: in <module>
[2022-03-09T08:28:51.233Z] from scipy.linalg.interpolative import interp_decomp
[2022-03-09T08:28:51.233Z] /usr/lib/python3.10/site-packages/scipy/linalg/interpolative.py:385: in <module>
[2022-03-09T08:28:51.233Z] import scipy.linalg._interpolative_backend as _backend
[2022-03-09T08:28:51.233Z] _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
[2022-03-09T08:28:51.233Z]
[2022-03-09T08:28:51.233Z] #******************************************************************************
[2022-03-09T08:28:51.233Z] # Copyright (C) 2013 Kenneth L. Ho
[2022-03-09T08:28:51.233Z] #
[2022-03-09T08:28:51.233Z] # Redistribution and use in source and binary forms, with or without
[2022-03-09T08:28:51.233Z] # modification, are permitted provided that the following conditions are met:
[2022-03-09T08:28:51.233Z] #
[2022-03-09T08:28:51.233Z] # Redistributions of source code must retain the above copyright notice, this
[2022-03-09T08:28:51.233Z] # list of conditions and the following disclaimer. Redistributions in binary
[2022-03-09T08:28:51.233Z] # form must reproduce the above copyright notice, this list of conditions and
[2022-03-09T08:28:51.233Z] # the following disclaimer in the documentation and/or other materials
[2022-03-09T08:28:51.233Z] # provided with the distribution.
[2022-03-09T08:28:51.233Z] #
[2022-03-09T08:28:51.233Z] # None of the names of the copyright holders may be used to endorse or
[2022-03-09T08:28:51.233Z] # promote products derived from this software without specific prior written
[2022-03-09T08:28:51.233Z] # permission.
[2022-03-09T08:28:51.233Z] #
[2022-03-09T08:28:51.233Z] # THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
[2022-03-09T08:28:51.233Z] # AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
[2022-03-09T08:28:51.233Z] # IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
[2022-03-09T08:28:51.233Z] # ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
[2022-03-09T08:28:51.233Z] # LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
[2022-03-09T08:28:51.233Z] # CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
[2022-03-09T08:28:51.233Z] # SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
[2022-03-09T08:28:51.233Z] # INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
[2022-03-09T08:28:51.233Z] # CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
[2022-03-09T08:28:51.233Z] # ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
[2022-03-09T08:28:51.233Z] # POSSIBILITY OF SUCH DAMAGE.
[2022-03-09T08:28:51.233Z] #******************************************************************************
[2022-03-09T08:28:51.233Z]
[2022-03-09T08:28:51.233Z] """
[2022-03-09T08:28:51.233Z] Direct wrappers for Fortran `id_dist` backend.
[2022-03-09T08:28:51.233Z] """
[2022-03-09T08:28:51.233Z]
[2022-03-09T08:28:51.233Z] > import scipy.linalg._interpolative as _id
[2022-03-09T08:28:51.233Z] E ImportError: /usr/lib/python3.10/site-packages/scipy/linalg/_interpolative.cpython-310-x86_64-linux-gnu.so: undefined symbol: _ZGVbN2v_sin
[2022-03-09T08:28:51.233Z]
[2022-03-09T08:28:51.233Z] /usr/lib/python3.10/site-packages/scipy/linalg/_interpolative_backend.py:34: ImportError
[2022-03-09T08:28:51.233Z] _ TestMinimumWeightFullMatching.test_minimum_weight_full_matching_different_weight_key _
[2022-03-09T08:28:51.233Z]
[2022-03-09T08:28:51.233Z] self = <networkx.algorithms.bipartite.tests.test_matching.TestMinimumWeightFullMatching object at 0x7fe88628e560>
[2022-03-09T08:28:51.233Z]
[2022-03-09T08:28:51.233Z] def test_minimum_weight_full_matching_different_weight_key(self):
[2022-03-09T08:28:51.233Z] G = nx.complete_bipartite_graph(2, 2)
[2022-03-09T08:28:51.233Z] G.add_edge(0, 2, mass=2)
[2022-03-09T08:28:51.233Z] G.add_edge(0, 3, mass=0.2)
[2022-03-09T08:28:51.233Z] G.add_edge(1, 2, mass=1)
[2022-03-09T08:28:51.233Z] G.add_edge(1, 3, mass=2)
[2022-03-09T08:28:51.233Z] > matching = minimum_weight_full_matching(G, weight="mass")
[2022-03-09T08:28:51.233Z]
[2022-03-09T08:28:51.233Z] networkx/algorithms/bipartite/tests/test_matching.py:324:
[2022-03-09T08:28:51.233Z] _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
[2022-03-09T08:28:51.233Z] networkx/algorithms/bipartite/matching.py:561: in minimum_weight_full_matching
[2022-03-09T08:28:51.233Z] import scipy.optimize # call as sp.optimize
[2022-03-09T08:28:51.233Z] /usr/lib/python3.10/site-packages/scipy/optimize/__init__.py:412: in <module>
[2022-03-09T08:28:51.233Z] from ._linprog import linprog, linprog_verbose_callback
[2022-03-09T08:28:51.233Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog.py:23: in <module>
[2022-03-09T08:28:51.233Z] from ._linprog_ip import _linprog_ip
[2022-03-09T08:28:51.233Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog_ip.py:27: in <module>
[2022-03-09T08:28:51.233Z] from ._linprog_util import _postsolve
[2022-03-09T08:28:51.233Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog_util.py:9: in <module>
[2022-03-09T08:28:51.233Z] from scipy.optimize._remove_redundancy import (
[2022-03-09T08:28:51.233Z] /usr/lib/python3.10/site-packages/scipy/optimize/_remove_redundancy.py:9: in <module>
[2022-03-09T08:28:51.233Z] from scipy.linalg.interpolative import interp_decomp
[2022-03-09T08:28:51.234Z] /usr/lib/python3.10/site-packages/scipy/linalg/interpolative.py:385: in <module>
[2022-03-09T08:28:51.234Z] import scipy.linalg._interpolative_backend as _backend
[2022-03-09T08:28:51.234Z] _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
[2022-03-09T08:28:51.234Z]
[2022-03-09T08:28:51.234Z] #******************************************************************************
[2022-03-09T08:28:51.234Z] # Copyright (C) 2013 Kenneth L. Ho
[2022-03-09T08:28:51.234Z] #
[2022-03-09T08:28:51.234Z] # Redistribution and use in source and binary forms, with or without
[2022-03-09T08:28:51.234Z] # modification, are permitted provided that the following conditions are met:
[2022-03-09T08:28:51.234Z] #
[2022-03-09T08:28:51.234Z] # Redistributions of source code must retain the above copyright notice, this
[2022-03-09T08:28:51.234Z] # list of conditions and the following disclaimer. Redistributions in binary
[2022-03-09T08:28:51.234Z] # form must reproduce the above copyright notice, this list of conditions and
[2022-03-09T08:28:51.234Z] # the following disclaimer in the documentation and/or other materials
[2022-03-09T08:28:51.234Z] # provided with the distribution.
[2022-03-09T08:28:51.234Z] #
[2022-03-09T08:28:51.234Z] # None of the names of the copyright holders may be used to endorse or
[2022-03-09T08:28:51.234Z] # promote products derived from this software without specific prior written
[2022-03-09T08:28:51.234Z] # permission.
[2022-03-09T08:28:51.234Z] #
[2022-03-09T08:28:51.234Z] # THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
[2022-03-09T08:28:51.234Z] # AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
[2022-03-09T08:28:51.234Z] # IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
[2022-03-09T08:28:51.234Z] # ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
[2022-03-09T08:28:51.234Z] # LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
[2022-03-09T08:28:51.234Z] # CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
[2022-03-09T08:28:51.234Z] # SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
[2022-03-09T08:28:51.234Z] # INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
[2022-03-09T08:28:51.234Z] # CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
[2022-03-09T08:28:51.234Z] # ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
[2022-03-09T08:28:51.234Z] # POSSIBILITY OF SUCH DAMAGE.
[2022-03-09T08:28:51.234Z] #******************************************************************************
[2022-03-09T08:28:51.234Z]
[2022-03-09T08:28:51.234Z] """
[2022-03-09T08:28:51.234Z] Direct wrappers for Fortran `id_dist` backend.
[2022-03-09T08:28:51.234Z] """
[2022-03-09T08:28:51.234Z]
[2022-03-09T08:28:51.234Z] > import scipy.linalg._interpolative as _id
[2022-03-09T08:28:51.234Z] E ImportError: /usr/lib/python3.10/site-packages/scipy/linalg/_interpolative.cpython-310-x86_64-linux-gnu.so: undefined symbol: _ZGVbN2v_sin
[2022-03-09T08:28:51.234Z]
[2022-03-09T08:28:51.234Z] /usr/lib/python3.10/site-packages/scipy/linalg/_interpolative_backend.py:34: ImportError
[2022-03-09T08:28:51.234Z] __________ TestSimilarity.test_graph_edit_distance_roots_and_timeout ___________
[2022-03-09T08:28:51.234Z]
[2022-03-09T08:28:51.234Z] self = <networkx.algorithms.tests.test_similarity.TestSimilarity object at 0x7fe884db03d0>
[2022-03-09T08:28:51.234Z]
[2022-03-09T08:28:51.234Z] def test_graph_edit_distance_roots_and_timeout(self):
[2022-03-09T08:28:51.234Z] G0 = nx.star_graph(5)
[2022-03-09T08:28:51.234Z] G1 = G0.copy()
[2022-03-09T08:28:51.234Z] > pytest.raises(ValueError, graph_edit_distance, G0, G1, roots=[2])
[2022-03-09T08:28:51.234Z]
[2022-03-09T08:28:51.234Z] networkx/algorithms/tests/test_similarity.py:47:
[2022-03-09T08:28:51.234Z] _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
[2022-03-09T08:28:51.234Z] networkx/algorithms/similarity.py:190: in graph_edit_distance
[2022-03-09T08:28:51.234Z] for vertex_path, edge_path, cost in optimize_edit_paths(
[2022-03-09T08:28:51.234Z] networkx/algorithms/similarity.py:673: in optimize_edit_paths
[2022-03-09T08:28:51.234Z] import scipy.optimize # call as sp.optimize
[2022-03-09T08:28:51.234Z] /usr/lib/python3.10/site-packages/scipy/optimize/__init__.py:412: in <module>
[2022-03-09T08:28:51.234Z] from ._linprog import linprog, linprog_verbose_callback
[2022-03-09T08:28:51.234Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog.py:23: in <module>
[2022-03-09T08:28:51.234Z] from ._linprog_ip import _linprog_ip
[2022-03-09T08:28:51.234Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog_ip.py:27: in <module>
[2022-03-09T08:28:51.234Z] from ._linprog_util import _postsolve
[2022-03-09T08:28:51.234Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog_util.py:9: in <module>
[2022-03-09T08:28:51.234Z] from scipy.optimize._remove_redundancy import (
[2022-03-09T08:28:51.234Z] /usr/lib/python3.10/site-packages/scipy/optimize/_remove_redundancy.py:9: in <module>
[2022-03-09T08:28:51.234Z] from scipy.linalg.interpolative import interp_decomp
[2022-03-09T08:28:51.234Z] /usr/lib/python3.10/site-packages/scipy/linalg/interpolative.py:385: in <module>
[2022-03-09T08:28:51.234Z] import scipy.linalg._interpolative_backend as _backend
[2022-03-09T08:28:51.234Z] _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
[2022-03-09T08:28:51.234Z]
[2022-03-09T08:28:51.234Z] #******************************************************************************
[2022-03-09T08:28:51.234Z] # Copyright (C) 2013 Kenneth L. Ho
[2022-03-09T08:28:51.234Z] #
[2022-03-09T08:28:51.235Z] # Redistribution and use in source and binary forms, with or without
[2022-03-09T08:28:51.235Z] # modification, are permitted provided that the following conditions are met:
[2022-03-09T08:28:51.235Z] #
[2022-03-09T08:28:51.235Z] # Redistributions of source code must retain the above copyright notice, this
[2022-03-09T08:28:51.235Z] # list of conditions and the following disclaimer. Redistributions in binary
[2022-03-09T08:28:51.235Z] # form must reproduce the above copyright notice, this list of conditions and
[2022-03-09T08:28:51.235Z] # the following disclaimer in the documentation and/or other materials
[2022-03-09T08:28:51.235Z] # provided with the distribution.
[2022-03-09T08:28:51.235Z] #
[2022-03-09T08:28:51.235Z] # None of the names of the copyright holders may be used to endorse or
[2022-03-09T08:28:51.235Z] # promote products derived from this software without specific prior written
[2022-03-09T08:28:51.235Z] # permission.
[2022-03-09T08:28:51.235Z] #
[2022-03-09T08:28:51.235Z] # THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
[2022-03-09T08:28:51.235Z] # AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
[2022-03-09T08:28:51.235Z] # IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
[2022-03-09T08:28:51.235Z] # ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
[2022-03-09T08:28:51.235Z] # LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
[2022-03-09T08:28:51.235Z] # CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
[2022-03-09T08:28:51.235Z] # SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
[2022-03-09T08:28:51.235Z] # INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
[2022-03-09T08:28:51.235Z] # CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
[2022-03-09T08:28:51.235Z] # ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
[2022-03-09T08:28:51.235Z] # POSSIBILITY OF SUCH DAMAGE.
[2022-03-09T08:28:51.235Z] #******************************************************************************
[2022-03-09T08:28:51.235Z]
[2022-03-09T08:28:51.235Z] """
[2022-03-09T08:28:51.235Z] Direct wrappers for Fortran `id_dist` backend.
[2022-03-09T08:28:51.235Z] """
[2022-03-09T08:28:51.235Z]
[2022-03-09T08:28:51.235Z] > import scipy.linalg._interpolative as _id
[2022-03-09T08:28:51.235Z] E ImportError: /usr/lib/python3.10/site-packages/scipy/linalg/_interpolative.cpython-310-x86_64-linux-gnu.so: undefined symbol: _ZGVbN2v_sin
[2022-03-09T08:28:51.235Z]
[2022-03-09T08:28:51.235Z] /usr/lib/python3.10/site-packages/scipy/linalg/_interpolative_backend.py:34: ImportError
[2022-03-09T08:28:51.235Z] ___________________ TestSimilarity.test_graph_edit_distance ____________________
[2022-03-09T08:28:51.235Z]
[2022-03-09T08:28:51.235Z] self = <networkx.algorithms.tests.test_similarity.TestSimilarity object at 0x7fe884db0520>
[2022-03-09T08:28:51.235Z]
[2022-03-09T08:28:51.235Z] def test_graph_edit_distance(self):
[2022-03-09T08:28:51.235Z] G0 = nx.Graph()
[2022-03-09T08:28:51.235Z] G1 = path_graph(6)
[2022-03-09T08:28:51.235Z] G2 = cycle_graph(6)
[2022-03-09T08:28:51.235Z] G3 = wheel_graph(7)
[2022-03-09T08:28:51.235Z]
[2022-03-09T08:28:51.235Z] > assert graph_edit_distance(G0, G0) == 0
[2022-03-09T08:28:51.235Z]
[2022-03-09T08:28:51.235Z] networkx/algorithms/tests/test_similarity.py:66:
[2022-03-09T08:28:51.235Z] _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
[2022-03-09T08:28:51.235Z] networkx/algorithms/similarity.py:190: in graph_edit_distance
[2022-03-09T08:28:51.235Z] for vertex_path, edge_path, cost in optimize_edit_paths(
[2022-03-09T08:28:51.235Z] networkx/algorithms/similarity.py:673: in optimize_edit_paths
[2022-03-09T08:28:51.235Z] import scipy.optimize # call as sp.optimize
[2022-03-09T08:28:51.235Z] /usr/lib/python3.10/site-packages/scipy/optimize/__init__.py:412: in <module>
[2022-03-09T08:28:51.235Z] from ._linprog import linprog, linprog_verbose_callback
[2022-03-09T08:28:51.235Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog.py:23: in <module>
[2022-03-09T08:28:51.235Z] from ._linprog_ip import _linprog_ip
[2022-03-09T08:28:51.235Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog_ip.py:27: in <module>
[2022-03-09T08:28:51.235Z] from ._linprog_util import _postsolve
[2022-03-09T08:28:51.235Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog_util.py:9: in <module>
[2022-03-09T08:28:51.235Z] from scipy.optimize._remove_redundancy import (
[2022-03-09T08:28:51.235Z] /usr/lib/python3.10/site-packages/scipy/optimize/_remove_redundancy.py:9: in <module>
[2022-03-09T08:28:51.235Z] from scipy.linalg.interpolative import interp_decomp
[2022-03-09T08:28:51.235Z] /usr/lib/python3.10/site-packages/scipy/linalg/interpolative.py:385: in <module>
[2022-03-09T08:28:51.235Z] import scipy.linalg._interpolative_backend as _backend
[2022-03-09T08:28:51.235Z] _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
[2022-03-09T08:28:51.235Z]
[2022-03-09T08:28:51.236Z] #******************************************************************************
[2022-03-09T08:28:51.236Z] # Copyright (C) 2013 Kenneth L. Ho
[2022-03-09T08:28:51.236Z] #
[2022-03-09T08:28:51.236Z] # Redistribution and use in source and binary forms, with or without
[2022-03-09T08:28:51.236Z] # modification, are permitted provided that the following conditions are met:
[2022-03-09T08:28:51.236Z] #
[2022-03-09T08:28:51.236Z] # Redistributions of source code must retain the above copyright notice, this
[2022-03-09T08:28:51.236Z] # list of conditions and the following disclaimer. Redistributions in binary
[2022-03-09T08:28:51.236Z] # form must reproduce the above copyright notice, this list of conditions and
[2022-03-09T08:28:51.236Z] # the following disclaimer in the documentation and/or other materials
[2022-03-09T08:28:51.236Z] # provided with the distribution.
[2022-03-09T08:28:51.236Z] #
[2022-03-09T08:28:51.236Z] # None of the names of the copyright holders may be used to endorse or
[2022-03-09T08:28:51.236Z] # promote products derived from this software without specific prior written
[2022-03-09T08:28:51.236Z] # permission.
[2022-03-09T08:28:51.236Z] #
[2022-03-09T08:28:51.236Z] # THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
[2022-03-09T08:28:51.236Z] # AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
[2022-03-09T08:28:51.236Z] # IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
[2022-03-09T08:28:51.236Z] # ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
[2022-03-09T08:28:51.236Z] # LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
[2022-03-09T08:28:51.236Z] # CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
[2022-03-09T08:28:51.236Z] # SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
[2022-03-09T08:28:51.236Z] # INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
[2022-03-09T08:28:51.236Z] # CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
[2022-03-09T08:28:51.236Z] # ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
[2022-03-09T08:28:51.236Z] # POSSIBILITY OF SUCH DAMAGE.
[2022-03-09T08:28:51.236Z] #******************************************************************************
[2022-03-09T08:28:51.236Z]
[2022-03-09T08:28:51.236Z] """
[2022-03-09T08:28:51.236Z] Direct wrappers for Fortran `id_dist` backend.
[2022-03-09T08:28:51.236Z] """
[2022-03-09T08:28:51.236Z]
[2022-03-09T08:28:51.236Z] > import scipy.linalg._interpolative as _id
[2022-03-09T08:28:51.236Z] E ImportError: /usr/lib/python3.10/site-packages/scipy/linalg/_interpolative.cpython-310-x86_64-linux-gnu.so: undefined symbol: _ZGVbN2v_sin
[2022-03-09T08:28:51.236Z]
[2022-03-09T08:28:51.236Z] /usr/lib/python3.10/site-packages/scipy/linalg/_interpolative_backend.py:34: ImportError
[2022-03-09T08:28:51.236Z] ______________ TestSimilarity.test_graph_edit_distance_node_match ______________
[2022-03-09T08:28:51.236Z]
[2022-03-09T08:28:51.236Z] self = <networkx.algorithms.tests.test_similarity.TestSimilarity object at 0x7fe884db0640>
[2022-03-09T08:28:51.236Z]
[2022-03-09T08:28:51.236Z] def test_graph_edit_distance_node_match(self):
[2022-03-09T08:28:51.236Z] G1 = cycle_graph(5)
[2022-03-09T08:28:51.236Z] G2 = cycle_graph(5)
[2022-03-09T08:28:51.236Z] for n, attr in G1.nodes.items():
[2022-03-09T08:28:51.236Z] attr["color"] = "red" if n % 2 == 0 else "blue"
[2022-03-09T08:28:51.236Z] for n, attr in G2.nodes.items():
[2022-03-09T08:28:51.236Z] attr["color"] = "red" if n % 2 == 1 else "blue"
[2022-03-09T08:28:51.236Z] > assert graph_edit_distance(G1, G2) == 0
[2022-03-09T08:28:51.236Z]
[2022-03-09T08:28:51.236Z] networkx/algorithms/tests/test_similarity.py:93:
[2022-03-09T08:28:51.236Z] _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
[2022-03-09T08:28:51.236Z] networkx/algorithms/similarity.py:190: in graph_edit_distance
[2022-03-09T08:28:51.236Z] for vertex_path, edge_path, cost in optimize_edit_paths(
[2022-03-09T08:28:51.236Z] networkx/algorithms/similarity.py:673: in optimize_edit_paths
[2022-03-09T08:28:51.236Z] import scipy.optimize # call as sp.optimize
[2022-03-09T08:28:51.236Z] /usr/lib/python3.10/site-packages/scipy/optimize/__init__.py:412: in <module>
[2022-03-09T08:28:51.236Z] from ._linprog import linprog, linprog_verbose_callback
[2022-03-09T08:28:51.236Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog.py:23: in <module>
[2022-03-09T08:28:51.236Z] from ._linprog_ip import _linprog_ip
[2022-03-09T08:28:51.236Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog_ip.py:27: in <module>
[2022-03-09T08:28:51.236Z] from ._linprog_util import _postsolve
[2022-03-09T08:28:51.236Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog_util.py:9: in <module>
[2022-03-09T08:28:51.236Z] from scipy.optimize._remove_redundancy import (
[2022-03-09T08:28:51.236Z] /usr/lib/python3.10/site-packages/scipy/optimize/_remove_redundancy.py:9: in <module>
[2022-03-09T08:28:51.236Z] from scipy.linalg.interpolative import interp_decomp
[2022-03-09T08:28:51.236Z] /usr/lib/python3.10/site-packages/scipy/linalg/interpolative.py:385: in <module>
[2022-03-09T08:28:51.236Z] import scipy.linalg._interpolative_backend as _backend
[2022-03-09T08:28:51.236Z] _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
[2022-03-09T08:28:51.236Z]
[2022-03-09T08:28:51.236Z] #******************************************************************************
[2022-03-09T08:28:51.236Z] # Copyright (C) 2013 Kenneth L. Ho
[2022-03-09T08:28:51.236Z] #
[2022-03-09T08:28:51.236Z] # Redistribution and use in source and binary forms, with or without
[2022-03-09T08:28:51.237Z] # modification, are permitted provided that the following conditions are met:
[2022-03-09T08:28:51.237Z] #
[2022-03-09T08:28:51.237Z] # Redistributions of source code must retain the above copyright notice, this
[2022-03-09T08:28:51.237Z] # list of conditions and the following disclaimer. Redistributions in binary
[2022-03-09T08:28:51.237Z] # form must reproduce the above copyright notice, this list of conditions and
[2022-03-09T08:28:51.237Z] # the following disclaimer in the documentation and/or other materials
[2022-03-09T08:28:51.237Z] # provided with the distribution.
[2022-03-09T08:28:51.237Z] #
[2022-03-09T08:28:51.237Z] # None of the names of the copyright holders may be used to endorse or
[2022-03-09T08:28:51.237Z] # promote products derived from this software without specific prior written
[2022-03-09T08:28:51.237Z] # permission.
[2022-03-09T08:28:51.237Z] #
[2022-03-09T08:28:51.237Z] # THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
[2022-03-09T08:28:51.237Z] # AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
[2022-03-09T08:28:51.237Z] # IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
[2022-03-09T08:28:51.237Z] # ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
[2022-03-09T08:28:51.237Z] # LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
[2022-03-09T08:28:51.237Z] # CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
[2022-03-09T08:28:51.237Z] # SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
[2022-03-09T08:28:51.237Z] # INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
[2022-03-09T08:28:51.237Z] # CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
[2022-03-09T08:28:51.237Z] # ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
[2022-03-09T08:28:51.237Z] # POSSIBILITY OF SUCH DAMAGE.
[2022-03-09T08:28:51.237Z] #******************************************************************************
[2022-03-09T08:28:51.237Z]
[2022-03-09T08:28:51.237Z] """
[2022-03-09T08:28:51.237Z] Direct wrappers for Fortran `id_dist` backend.
[2022-03-09T08:28:51.237Z] """
[2022-03-09T08:28:51.237Z]
[2022-03-09T08:28:51.237Z] > import scipy.linalg._interpolative as _id
[2022-03-09T08:28:51.237Z] E ImportError: /usr/lib/python3.10/site-packages/scipy/linalg/_interpolative.cpython-310-x86_64-linux-gnu.so: undefined symbol: _ZGVbN2v_sin
[2022-03-09T08:28:51.237Z]
[2022-03-09T08:28:51.237Z] /usr/lib/python3.10/site-packages/scipy/linalg/_interpolative_backend.py:34: ImportError
[2022-03-09T08:28:51.237Z] ______________ TestSimilarity.test_graph_edit_distance_edge_match ______________
[2022-03-09T08:28:51.237Z]
[2022-03-09T08:28:51.237Z] self = <networkx.algorithms.tests.test_similarity.TestSimilarity object at 0x7fe884db0a30>
[2022-03-09T08:28:51.237Z]
[2022-03-09T08:28:51.237Z] def test_graph_edit_distance_edge_match(self):
[2022-03-09T08:28:51.237Z] G1 = path_graph(6)
[2022-03-09T08:28:51.237Z] G2 = path_graph(6)
[2022-03-09T08:28:51.237Z] for e, attr in G1.edges.items():
[2022-03-09T08:28:51.237Z] attr["color"] = "red" if min(e) % 2 == 0 else "blue"
[2022-03-09T08:28:51.237Z] for e, attr in G2.edges.items():
[2022-03-09T08:28:51.237Z] attr["color"] = "red" if min(e) // 3 == 0 else "blue"
[2022-03-09T08:28:51.237Z] > assert graph_edit_distance(G1, G2) == 0
[2022-03-09T08:28:51.237Z]
[2022-03-09T08:28:51.237Z] networkx/algorithms/tests/test_similarity.py:108:
[2022-03-09T08:28:51.237Z] _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
[2022-03-09T08:28:51.237Z] networkx/algorithms/similarity.py:190: in graph_edit_distance
[2022-03-09T08:28:51.237Z] for vertex_path, edge_path, cost in optimize_edit_paths(
[2022-03-09T08:28:51.237Z] networkx/algorithms/similarity.py:673: in optimize_edit_paths
[2022-03-09T08:28:51.237Z] import scipy.optimize # call as sp.optimize
[2022-03-09T08:28:51.237Z] /usr/lib/python3.10/site-packages/scipy/optimize/__init__.py:412: in <module>
[2022-03-09T08:28:51.237Z] from ._linprog import linprog, linprog_verbose_callback
[2022-03-09T08:28:51.237Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog.py:23: in <module>
[2022-03-09T08:28:51.237Z] from ._linprog_ip import _linprog_ip
[2022-03-09T08:28:51.237Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog_ip.py:27: in <module>
[2022-03-09T08:28:51.237Z] from ._linprog_util import _postsolve
[2022-03-09T08:28:51.237Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog_util.py:9: in <module>
[2022-03-09T08:28:51.237Z] from scipy.optimize._remove_redundancy import (
[2022-03-09T08:28:51.237Z] /usr/lib/python3.10/site-packages/scipy/optimize/_remove_redundancy.py:9: in <module>
[2022-03-09T08:28:51.237Z] from scipy.linalg.interpolative import interp_decomp
[2022-03-09T08:28:51.238Z] /usr/lib/python3.10/site-packages/scipy/linalg/interpolative.py:385: in <module>
[2022-03-09T08:28:51.238Z] import scipy.linalg._interpolative_backend as _backend
[2022-03-09T08:28:51.238Z] _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
[2022-03-09T08:28:51.238Z]
[2022-03-09T08:28:51.238Z] #******************************************************************************
[2022-03-09T08:28:51.238Z] # Copyright (C) 2013 Kenneth L. Ho
[2022-03-09T08:28:51.238Z] #
[2022-03-09T08:28:51.238Z] # Redistribution and use in source and binary forms, with or without
[2022-03-09T08:28:51.238Z] # modification, are permitted provided that the following conditions are met:
[2022-03-09T08:28:51.238Z] #
[2022-03-09T08:28:51.238Z] # Redistributions of source code must retain the above copyright notice, this
[2022-03-09T08:28:51.238Z] # list of conditions and the following disclaimer. Redistributions in binary
[2022-03-09T08:28:51.238Z] # form must reproduce the above copyright notice, this list of conditions and
[2022-03-09T08:28:51.238Z] # the following disclaimer in the documentation and/or other materials
[2022-03-09T08:28:51.238Z] # provided with the distribution.
[2022-03-09T08:28:51.238Z] #
[2022-03-09T08:28:51.238Z] # None of the names of the copyright holders may be used to endorse or
[2022-03-09T08:28:51.238Z] # promote products derived from this software without specific prior written
[2022-03-09T08:28:51.238Z] # permission.
[2022-03-09T08:28:51.238Z] #
[2022-03-09T08:28:51.238Z] # THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
[2022-03-09T08:28:51.238Z] # AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
[2022-03-09T08:28:51.238Z] # IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
[2022-03-09T08:28:51.238Z] # ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
[2022-03-09T08:28:51.238Z] # LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
[2022-03-09T08:28:51.238Z] # CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
[2022-03-09T08:28:51.238Z] # SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
[2022-03-09T08:28:51.238Z] # INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
[2022-03-09T08:28:51.238Z] # CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
[2022-03-09T08:28:51.238Z] # ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
[2022-03-09T08:28:51.238Z] # POSSIBILITY OF SUCH DAMAGE.
[2022-03-09T08:28:51.238Z] #******************************************************************************
[2022-03-09T08:28:51.238Z]
[2022-03-09T08:28:51.238Z] """
[2022-03-09T08:28:51.238Z] Direct wrappers for Fortran `id_dist` backend.
[2022-03-09T08:28:51.238Z] """
[2022-03-09T08:28:51.238Z]
[2022-03-09T08:28:51.238Z] > import scipy.linalg._interpolative as _id
[2022-03-09T08:28:51.238Z] E ImportError: /usr/lib/python3.10/site-packages/scipy/linalg/_interpolative.cpython-310-x86_64-linux-gnu.so: undefined symbol: _ZGVbN2v_sin
[2022-03-09T08:28:51.238Z]
[2022-03-09T08:28:51.238Z] /usr/lib/python3.10/site-packages/scipy/linalg/_interpolative_backend.py:34: ImportError
[2022-03-09T08:28:51.238Z] ______________ TestSimilarity.test_graph_edit_distance_node_cost _______________
[2022-03-09T08:28:51.238Z]
[2022-03-09T08:28:51.238Z] self = <networkx.algorithms.tests.test_similarity.TestSimilarity object at 0x7fe884db0ca0>
[2022-03-09T08:28:51.238Z]
[2022-03-09T08:28:51.238Z] def test_graph_edit_distance_node_cost(self):
[2022-03-09T08:28:51.238Z] G1 = path_graph(6)
[2022-03-09T08:28:51.238Z] G2 = path_graph(6)
[2022-03-09T08:28:51.238Z] for n, attr in G1.nodes.items():
[2022-03-09T08:28:51.238Z] attr["color"] = "red" if n % 2 == 0 else "blue"
[2022-03-09T08:28:51.238Z] for n, attr in G2.nodes.items():
[2022-03-09T08:28:51.238Z] attr["color"] = "red" if n % 2 == 1 else "blue"
[2022-03-09T08:28:51.238Z]
[2022-03-09T08:28:51.238Z] def node_subst_cost(uattr, vattr):
[2022-03-09T08:28:51.238Z] if uattr["color"] == vattr["color"]:
[2022-03-09T08:28:51.238Z] return 1
[2022-03-09T08:28:51.238Z] else:
[2022-03-09T08:28:51.238Z] return 10
[2022-03-09T08:28:51.238Z]
[2022-03-09T08:28:51.238Z] def node_del_cost(attr):
[2022-03-09T08:28:51.238Z] if attr["color"] == "blue":
[2022-03-09T08:28:51.238Z] return 20
[2022-03-09T08:28:51.238Z] else:
[2022-03-09T08:28:51.238Z] return 50
[2022-03-09T08:28:51.238Z]
[2022-03-09T08:28:51.238Z] def node_ins_cost(attr):
[2022-03-09T08:28:51.238Z] if attr["color"] == "blue":
[2022-03-09T08:28:51.238Z] return 40
[2022-03-09T08:28:51.238Z] else:
[2022-03-09T08:28:51.238Z] return 100
[2022-03-09T08:28:51.238Z]
[2022-03-09T08:28:51.238Z] > assert (
[2022-03-09T08:28:51.238Z] graph_edit_distance(
[2022-03-09T08:28:51.238Z] G1,
[2022-03-09T08:28:51.238Z] G2,
[2022-03-09T08:28:51.238Z] node_subst_cost=node_subst_cost,
[2022-03-09T08:28:51.238Z] node_del_cost=node_del_cost,
[2022-03-09T08:28:51.238Z] node_ins_cost=node_ins_cost,
[2022-03-09T08:28:51.238Z] )
[2022-03-09T08:28:51.238Z] == 6
[2022-03-09T08:28:51.238Z] )
[2022-03-09T08:28:51.238Z]
[2022-03-09T08:28:51.238Z] networkx/algorithms/tests/test_similarity.py:142:
[2022-03-09T08:28:51.238Z] _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
[2022-03-09T08:28:51.238Z] networkx/algorithms/similarity.py:190: in graph_edit_distance
[2022-03-09T08:28:51.238Z] for vertex_path, edge_path, cost in optimize_edit_paths(
[2022-03-09T08:28:51.239Z] networkx/algorithms/similarity.py:673: in optimize_edit_paths
[2022-03-09T08:28:51.239Z] import scipy.optimize # call as sp.optimize
[2022-03-09T08:28:51.239Z] /usr/lib/python3.10/site-packages/scipy/optimize/__init__.py:412: in <module>
[2022-03-09T08:28:51.239Z] from ._linprog import linprog, linprog_verbose_callback
[2022-03-09T08:28:51.239Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog.py:23: in <module>
[2022-03-09T08:28:51.239Z] from ._linprog_ip import _linprog_ip
[2022-03-09T08:28:51.239Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog_ip.py:27: in <module>
[2022-03-09T08:28:51.239Z] from ._linprog_util import _postsolve
[2022-03-09T08:28:51.239Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog_util.py:9: in <module>
[2022-03-09T08:28:51.239Z] from scipy.optimize._remove_redundancy import (
[2022-03-09T08:28:51.239Z] /usr/lib/python3.10/site-packages/scipy/optimize/_remove_redundancy.py:9: in <module>
[2022-03-09T08:28:51.239Z] from scipy.linalg.interpolative import interp_decomp
[2022-03-09T08:28:51.239Z] /usr/lib/python3.10/site-packages/scipy/linalg/interpolative.py:385: in <module>
[2022-03-09T08:28:51.239Z] import scipy.linalg._interpolative_backend as _backend
[2022-03-09T08:28:51.239Z] _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
[2022-03-09T08:28:51.239Z]
[2022-03-09T08:28:51.239Z] #******************************************************************************
[2022-03-09T08:28:51.239Z] # Copyright (C) 2013 Kenneth L. Ho
[2022-03-09T08:28:51.239Z] #
[2022-03-09T08:28:51.239Z] # Redistribution and use in source and binary forms, with or without
[2022-03-09T08:28:51.239Z] # modification, are permitted provided that the following conditions are met:
[2022-03-09T08:28:51.239Z] #
[2022-03-09T08:28:51.239Z] # Redistributions of source code must retain the above copyright notice, this
[2022-03-09T08:28:51.239Z] # list of conditions and the following disclaimer. Redistributions in binary
[2022-03-09T08:28:51.239Z] # form must reproduce the above copyright notice, this list of conditions and
[2022-03-09T08:28:51.239Z] # the following disclaimer in the documentation and/or other materials
[2022-03-09T08:28:51.239Z] # provided with the distribution.
[2022-03-09T08:28:51.239Z] #
[2022-03-09T08:28:51.239Z] # None of the names of the copyright holders may be used to endorse or
[2022-03-09T08:28:51.239Z] # promote products derived from this software without specific prior written
[2022-03-09T08:28:51.239Z] # permission.
[2022-03-09T08:28:51.239Z] #
[2022-03-09T08:28:51.239Z] # THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
[2022-03-09T08:28:51.239Z] # AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
[2022-03-09T08:28:51.239Z] # IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
[2022-03-09T08:28:51.239Z] # ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
[2022-03-09T08:28:51.239Z] # LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
[2022-03-09T08:28:51.239Z] # CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
[2022-03-09T08:28:51.239Z] # SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
[2022-03-09T08:28:51.239Z] # INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
[2022-03-09T08:28:51.239Z] # CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
[2022-03-09T08:28:51.239Z] # ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
[2022-03-09T08:28:51.239Z] # POSSIBILITY OF SUCH DAMAGE.
[2022-03-09T08:28:51.239Z] #******************************************************************************
[2022-03-09T08:28:51.239Z]
[2022-03-09T08:28:51.239Z] """
[2022-03-09T08:28:51.239Z] Direct wrappers for Fortran `id_dist` backend.
[2022-03-09T08:28:51.239Z] """
[2022-03-09T08:28:51.239Z]
[2022-03-09T08:28:51.239Z] > import scipy.linalg._interpolative as _id
[2022-03-09T08:28:51.239Z] E ImportError: /usr/lib/python3.10/site-packages/scipy/linalg/_interpolative.cpython-310-x86_64-linux-gnu.so: undefined symbol: _ZGVbN2v_sin
[2022-03-09T08:28:51.239Z]
[2022-03-09T08:28:51.239Z] /usr/lib/python3.10/site-packages/scipy/linalg/_interpolative_backend.py:34: ImportError
[2022-03-09T08:28:51.239Z] ______________ TestSimilarity.test_graph_edit_distance_edge_cost _______________
[2022-03-09T08:28:51.239Z]
[2022-03-09T08:28:51.239Z] self = <networkx.algorithms.tests.test_similarity.TestSimilarity object at 0x7fe884db0fa0>
[2022-03-09T08:28:51.239Z]
[2022-03-09T08:28:51.239Z] def test_graph_edit_distance_edge_cost(self):
[2022-03-09T08:28:51.239Z] G1 = path_graph(6)
[2022-03-09T08:28:51.239Z] G2 = path_graph(6)
[2022-03-09T08:28:51.239Z] for e, attr in G1.edges.items():
[2022-03-09T08:28:51.239Z] attr["color"] = "red" if min(e) % 2 == 0 else "blue"
[2022-03-09T08:28:51.239Z] for e, attr in G2.edges.items():
[2022-03-09T08:28:51.239Z] attr["color"] = "red" if min(e) // 3 == 0 else "blue"
[2022-03-09T08:28:51.239Z]
[2022-03-09T08:28:51.239Z] def edge_subst_cost(gattr, hattr):
[2022-03-09T08:28:51.239Z] if gattr["color"] == hattr["color"]:
[2022-03-09T08:28:51.239Z] return 0.01
[2022-03-09T08:28:51.239Z] else:
[2022-03-09T08:28:51.239Z] return 0.1
[2022-03-09T08:28:51.239Z]
[2022-03-09T08:28:51.239Z] def edge_del_cost(attr):
[2022-03-09T08:28:51.239Z] if attr["color"] == "blue":
[2022-03-09T08:28:51.239Z] return 0.2
[2022-03-09T08:28:51.239Z] else:
[2022-03-09T08:28:51.239Z] return 0.5
[2022-03-09T08:28:51.239Z]
[2022-03-09T08:28:51.239Z] def edge_ins_cost(attr):
[2022-03-09T08:28:51.240Z] if attr["color"] == "blue":
[2022-03-09T08:28:51.240Z] return 0.4
[2022-03-09T08:28:51.240Z] else:
[2022-03-09T08:28:51.240Z] return 1.0
[2022-03-09T08:28:51.240Z]
[2022-03-09T08:28:51.240Z] > assert (
[2022-03-09T08:28:51.240Z] graph_edit_distance(
[2022-03-09T08:28:51.240Z] G1,
[2022-03-09T08:28:51.240Z] G2,
[2022-03-09T08:28:51.240Z] edge_subst_cost=edge_subst_cost,
[2022-03-09T08:28:51.240Z] edge_del_cost=edge_del_cost,
[2022-03-09T08:28:51.240Z] edge_ins_cost=edge_ins_cost,
[2022-03-09T08:28:51.240Z] )
[2022-03-09T08:28:51.240Z] == 0.23
[2022-03-09T08:28:51.240Z] )
[2022-03-09T08:28:51.240Z]
[2022-03-09T08:28:51.240Z] networkx/algorithms/tests/test_similarity.py:179:
[2022-03-09T08:28:51.240Z] _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
[2022-03-09T08:28:51.240Z] networkx/algorithms/similarity.py:190: in graph_edit_distance
[2022-03-09T08:28:51.240Z] for vertex_path, edge_path, cost in optimize_edit_paths(
[2022-03-09T08:28:51.240Z] networkx/algorithms/similarity.py:673: in optimize_edit_paths
[2022-03-09T08:28:51.240Z] import scipy.optimize # call as sp.optimize
[2022-03-09T08:28:51.240Z] /usr/lib/python3.10/site-packages/scipy/optimize/__init__.py:412: in <module>
[2022-03-09T08:28:51.240Z] from ._linprog import linprog, linprog_verbose_callback
[2022-03-09T08:28:51.240Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog.py:23: in <module>
[2022-03-09T08:28:51.240Z] from ._linprog_ip import _linprog_ip
[2022-03-09T08:28:51.240Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog_ip.py:27: in <module>
[2022-03-09T08:28:51.240Z] from ._linprog_util import _postsolve
[2022-03-09T08:28:51.240Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog_util.py:9: in <module>
[2022-03-09T08:28:51.240Z] from scipy.optimize._remove_redundancy import (
[2022-03-09T08:28:51.240Z] /usr/lib/python3.10/site-packages/scipy/optimize/_remove_redundancy.py:9: in <module>
[2022-03-09T08:28:51.240Z] from scipy.linalg.interpolative import interp_decomp
[2022-03-09T08:28:51.240Z] /usr/lib/python3.10/site-packages/scipy/linalg/interpolative.py:385: in <module>
[2022-03-09T08:28:51.240Z] import scipy.linalg._interpolative_backend as _backend
[2022-03-09T08:28:51.240Z] _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
[2022-03-09T08:28:51.240Z]
[2022-03-09T08:28:51.240Z] #******************************************************************************
[2022-03-09T08:28:51.240Z] # Copyright (C) 2013 Kenneth L. Ho
[2022-03-09T08:28:51.240Z] #
[2022-03-09T08:28:51.240Z] # Redistribution and use in source and binary forms, with or without
[2022-03-09T08:28:51.240Z] # modification, are permitted provided that the following conditions are met:
[2022-03-09T08:28:51.240Z] #
[2022-03-09T08:28:51.240Z] # Redistributions of source code must retain the above copyright notice, this
[2022-03-09T08:28:51.240Z] # list of conditions and the following disclaimer. Redistributions in binary
[2022-03-09T08:28:51.240Z] # form must reproduce the above copyright notice, this list of conditions and
[2022-03-09T08:28:51.240Z] # the following disclaimer in the documentation and/or other materials
[2022-03-09T08:28:51.240Z] # provided with the distribution.
[2022-03-09T08:28:51.240Z] #
[2022-03-09T08:28:51.240Z] # None of the names of the copyright holders may be used to endorse or
[2022-03-09T08:28:51.240Z] # promote products derived from this software without specific prior written
[2022-03-09T08:28:51.240Z] # permission.
[2022-03-09T08:28:51.240Z] #
[2022-03-09T08:28:51.240Z] # THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
[2022-03-09T08:28:51.240Z] # AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
[2022-03-09T08:28:51.240Z] # IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
[2022-03-09T08:28:51.240Z] # ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
[2022-03-09T08:28:51.240Z] # LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
[2022-03-09T08:28:51.240Z] # CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
[2022-03-09T08:28:51.240Z] # SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
[2022-03-09T08:28:51.240Z] # INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
[2022-03-09T08:28:51.240Z] # CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
[2022-03-09T08:28:51.240Z] # ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
[2022-03-09T08:28:51.240Z] # POSSIBILITY OF SUCH DAMAGE.
[2022-03-09T08:28:51.240Z] #******************************************************************************
[2022-03-09T08:28:51.240Z]
[2022-03-09T08:28:51.240Z] """
[2022-03-09T08:28:51.240Z] Direct wrappers for Fortran `id_dist` backend.
[2022-03-09T08:28:51.240Z] """
[2022-03-09T08:28:51.240Z]
[2022-03-09T08:28:51.240Z] > import scipy.linalg._interpolative as _id
[2022-03-09T08:28:51.240Z] E ImportError: /usr/lib/python3.10/site-packages/scipy/linalg/_interpolative.cpython-310-x86_64-linux-gnu.so: undefined symbol: _ZGVbN2v_sin
[2022-03-09T08:28:51.240Z]
[2022-03-09T08:28:51.240Z] /usr/lib/python3.10/site-packages/scipy/linalg/_interpolative_backend.py:34: ImportError
[2022-03-09T08:28:51.240Z] _____________ TestSimilarity.test_graph_edit_distance_upper_bound ______________
[2022-03-09T08:28:51.240Z]
[2022-03-09T08:28:51.240Z] self = <networkx.algorithms.tests.test_similarity.TestSimilarity object at 0x7fe884db0f70>
[2022-03-09T08:28:51.240Z]
[2022-03-09T08:28:51.240Z] def test_graph_edit_distance_upper_bound(self):
[2022-03-09T08:28:51.241Z] G1 = circular_ladder_graph(2)
[2022-03-09T08:28:51.241Z] G2 = circular_ladder_graph(6)
[2022-03-09T08:28:51.241Z] > assert graph_edit_distance(G1, G2, upper_bound=5) is None
[2022-03-09T08:28:51.241Z]
[2022-03-09T08:28:51.241Z] networkx/algorithms/tests/test_similarity.py:193:
[2022-03-09T08:28:51.241Z] _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
[2022-03-09T08:28:51.241Z] networkx/algorithms/similarity.py:190: in graph_edit_distance
[2022-03-09T08:28:51.241Z] for vertex_path, edge_path, cost in optimize_edit_paths(
[2022-03-09T08:28:51.241Z] networkx/algorithms/similarity.py:673: in optimize_edit_paths
[2022-03-09T08:28:51.241Z] import scipy.optimize # call as sp.optimize
[2022-03-09T08:28:51.241Z] /usr/lib/python3.10/site-packages/scipy/optimize/__init__.py:412: in <module>
[2022-03-09T08:28:51.241Z] from ._linprog import linprog, linprog_verbose_callback
[2022-03-09T08:28:51.241Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog.py:23: in <module>
[2022-03-09T08:28:51.241Z] from ._linprog_ip import _linprog_ip
[2022-03-09T08:28:51.241Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog_ip.py:27: in <module>
[2022-03-09T08:28:51.241Z] from ._linprog_util import _postsolve
[2022-03-09T08:28:51.241Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog_util.py:9: in <module>
[2022-03-09T08:28:51.241Z] from scipy.optimize._remove_redundancy import (
[2022-03-09T08:28:51.241Z] /usr/lib/python3.10/site-packages/scipy/optimize/_remove_redundancy.py:9: in <module>
[2022-03-09T08:28:51.241Z] from scipy.linalg.interpolative import interp_decomp
[2022-03-09T08:28:51.241Z] /usr/lib/python3.10/site-packages/scipy/linalg/interpolative.py:385: in <module>
[2022-03-09T08:28:51.241Z] import scipy.linalg._interpolative_backend as _backend
[2022-03-09T08:28:51.241Z] _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
[2022-03-09T08:28:51.241Z]
[2022-03-09T08:28:51.241Z] #******************************************************************************
[2022-03-09T08:28:51.241Z] # Copyright (C) 2013 Kenneth L. Ho
[2022-03-09T08:28:51.241Z] #
[2022-03-09T08:28:51.241Z] # Redistribution and use in source and binary forms, with or without
[2022-03-09T08:28:51.241Z] # modification, are permitted provided that the following conditions are met:
[2022-03-09T08:28:51.241Z] #
[2022-03-09T08:28:51.241Z] # Redistributions of source code must retain the above copyright notice, this
[2022-03-09T08:28:51.241Z] # list of conditions and the following disclaimer. Redistributions in binary
[2022-03-09T08:28:51.241Z] # form must reproduce the above copyright notice, this list of conditions and
[2022-03-09T08:28:51.241Z] # the following disclaimer in the documentation and/or other materials
[2022-03-09T08:28:51.241Z] # provided with the distribution.
[2022-03-09T08:28:51.241Z] #
[2022-03-09T08:28:51.241Z] # None of the names of the copyright holders may be used to endorse or
[2022-03-09T08:28:51.241Z] # promote products derived from this software without specific prior written
[2022-03-09T08:28:51.241Z] # permission.
[2022-03-09T08:28:51.241Z] #
[2022-03-09T08:28:51.241Z] # THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
[2022-03-09T08:28:51.241Z] # AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
[2022-03-09T08:28:51.241Z] # IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
[2022-03-09T08:28:51.241Z] # ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
[2022-03-09T08:28:51.241Z] # LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
[2022-03-09T08:28:51.241Z] # CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
[2022-03-09T08:28:51.241Z] # SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
[2022-03-09T08:28:51.241Z] # INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
[2022-03-09T08:28:51.241Z] # CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
[2022-03-09T08:28:51.241Z] # ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
[2022-03-09T08:28:51.241Z] # POSSIBILITY OF SUCH DAMAGE.
[2022-03-09T08:28:51.241Z] #******************************************************************************
[2022-03-09T08:28:51.241Z]
[2022-03-09T08:28:51.241Z] """
[2022-03-09T08:28:51.241Z] Direct wrappers for Fortran `id_dist` backend.
[2022-03-09T08:28:51.241Z] """
[2022-03-09T08:28:51.241Z]
[2022-03-09T08:28:51.241Z] > import scipy.linalg._interpolative as _id
[2022-03-09T08:28:51.241Z] E ImportError: /usr/lib/python3.10/site-packages/scipy/linalg/_interpolative.cpython-310-x86_64-linux-gnu.so: undefined symbol: _ZGVbN2v_sin
[2022-03-09T08:28:51.241Z]
[2022-03-09T08:28:51.241Z] /usr/lib/python3.10/site-packages/scipy/linalg/_interpolative_backend.py:34: ImportError
[2022-03-09T08:28:51.241Z] ____________________ TestSimilarity.test_optimal_edit_paths ____________________
[2022-03-09T08:28:51.241Z]
[2022-03-09T08:28:51.241Z] self = <networkx.algorithms.tests.test_similarity.TestSimilarity object at 0x7fe884db1e70>
[2022-03-09T08:28:51.241Z]
[2022-03-09T08:28:51.241Z] def test_optimal_edit_paths(self):
[2022-03-09T08:28:51.241Z] G1 = path_graph(3)
[2022-03-09T08:28:51.241Z] G2 = cycle_graph(3)
[2022-03-09T08:28:51.241Z] > paths, cost = optimal_edit_paths(G1, G2)
[2022-03-09T08:28:51.241Z]
[2022-03-09T08:28:51.241Z] networkx/algorithms/tests/test_similarity.py:200:
[2022-03-09T08:28:51.241Z] _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
[2022-03-09T08:28:51.241Z] networkx/algorithms/similarity.py:351: in optimal_edit_paths
[2022-03-09T08:28:51.241Z] for vertex_path, edge_path, cost in optimize_edit_paths(
[2022-03-09T08:28:51.242Z] networkx/algorithms/similarity.py:673: in optimize_edit_paths
[2022-03-09T08:28:51.242Z] import scipy.optimize # call as sp.optimize
[2022-03-09T08:28:51.242Z] /usr/lib/python3.10/site-packages/scipy/optimize/__init__.py:412: in <module>
[2022-03-09T08:28:51.242Z] from ._linprog import linprog, linprog_verbose_callback
[2022-03-09T08:28:51.242Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog.py:23: in <module>
[2022-03-09T08:28:51.242Z] from ._linprog_ip import _linprog_ip
[2022-03-09T08:28:51.242Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog_ip.py:27: in <module>
[2022-03-09T08:28:51.242Z] from ._linprog_util import _postsolve
[2022-03-09T08:28:51.242Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog_util.py:9: in <module>
[2022-03-09T08:28:51.242Z] from scipy.optimize._remove_redundancy import (
[2022-03-09T08:28:51.242Z] /usr/lib/python3.10/site-packages/scipy/optimize/_remove_redundancy.py:9: in <module>
[2022-03-09T08:28:51.242Z] from scipy.linalg.interpolative import interp_decomp
[2022-03-09T08:28:51.242Z] /usr/lib/python3.10/site-packages/scipy/linalg/interpolative.py:385: in <module>
[2022-03-09T08:28:51.242Z] import scipy.linalg._interpolative_backend as _backend
[2022-03-09T08:28:51.242Z] _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
[2022-03-09T08:28:51.242Z]
[2022-03-09T08:28:51.242Z] #******************************************************************************
[2022-03-09T08:28:51.242Z] # Copyright (C) 2013 Kenneth L. Ho
[2022-03-09T08:28:51.242Z] #
[2022-03-09T08:28:51.242Z] # Redistribution and use in source and binary forms, with or without
[2022-03-09T08:28:51.242Z] # modification, are permitted provided that the following conditions are met:
[2022-03-09T08:28:51.242Z] #
[2022-03-09T08:28:51.242Z] # Redistributions of source code must retain the above copyright notice, this
[2022-03-09T08:28:51.242Z] # list of conditions and the following disclaimer. Redistributions in binary
[2022-03-09T08:28:51.242Z] # form must reproduce the above copyright notice, this list of conditions and
[2022-03-09T08:28:51.242Z] # the following disclaimer in the documentation and/or other materials
[2022-03-09T08:28:51.242Z] # provided with the distribution.
[2022-03-09T08:28:51.242Z] #
[2022-03-09T08:28:51.242Z] # None of the names of the copyright holders may be used to endorse or
[2022-03-09T08:28:51.242Z] # promote products derived from this software without specific prior written
[2022-03-09T08:28:51.242Z] # permission.
[2022-03-09T08:28:51.242Z] #
[2022-03-09T08:28:51.242Z] # THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
[2022-03-09T08:28:51.242Z] # AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
[2022-03-09T08:28:51.242Z] # IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
[2022-03-09T08:28:51.242Z] # ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
[2022-03-09T08:28:51.242Z] # LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
[2022-03-09T08:28:51.242Z] # CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
[2022-03-09T08:28:51.242Z] # SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
[2022-03-09T08:28:51.242Z] # INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
[2022-03-09T08:28:51.242Z] # CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
[2022-03-09T08:28:51.242Z] # ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
[2022-03-09T08:28:51.242Z] # POSSIBILITY OF SUCH DAMAGE.
[2022-03-09T08:28:51.242Z] #******************************************************************************
[2022-03-09T08:28:51.242Z]
[2022-03-09T08:28:51.242Z] """
[2022-03-09T08:28:51.242Z] Direct wrappers for Fortran `id_dist` backend.
[2022-03-09T08:28:51.242Z] """
[2022-03-09T08:28:51.242Z]
[2022-03-09T08:28:51.242Z] > import scipy.linalg._interpolative as _id
[2022-03-09T08:28:51.242Z] E ImportError: /usr/lib/python3.10/site-packages/scipy/linalg/_interpolative.cpython-310-x86_64-linux-gnu.so: undefined symbol: _ZGVbN2v_sin
[2022-03-09T08:28:51.242Z]
[2022-03-09T08:28:51.242Z] /usr/lib/python3.10/site-packages/scipy/linalg/_interpolative_backend.py:34: ImportError
[2022-03-09T08:28:51.242Z] _______________ TestSimilarity.test_optimize_graph_edit_distance _______________
[2022-03-09T08:28:51.242Z]
[2022-03-09T08:28:51.242Z] self = <networkx.algorithms.tests.test_similarity.TestSimilarity object at 0x7fe884db22c0>
[2022-03-09T08:28:51.242Z]
[2022-03-09T08:28:51.242Z] def test_optimize_graph_edit_distance(self):
[2022-03-09T08:28:51.242Z] G1 = circular_ladder_graph(2)
[2022-03-09T08:28:51.242Z] G2 = circular_ladder_graph(6)
[2022-03-09T08:28:51.242Z] bestcost = 1000
[2022-03-09T08:28:51.242Z] > for cost in optimize_graph_edit_distance(G1, G2):
[2022-03-09T08:28:51.242Z]
[2022-03-09T08:28:51.242Z] networkx/algorithms/tests/test_similarity.py:242:
[2022-03-09T08:28:51.242Z] _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
[2022-03-09T08:28:51.242Z] networkx/algorithms/similarity.py:506: in optimize_graph_edit_distance
[2022-03-09T08:28:51.242Z] for vertex_path, edge_path, cost in optimize_edit_paths(
[2022-03-09T08:28:51.242Z] networkx/algorithms/similarity.py:673: in optimize_edit_paths
[2022-03-09T08:28:51.242Z] import scipy.optimize # call as sp.optimize
[2022-03-09T08:28:51.242Z] /usr/lib/python3.10/site-packages/scipy/optimize/__init__.py:412: in <module>
[2022-03-09T08:28:51.242Z] from ._linprog import linprog, linprog_verbose_callback
[2022-03-09T08:28:51.242Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog.py:23: in <module>
[2022-03-09T08:28:51.242Z] from ._linprog_ip import _linprog_ip
[2022-03-09T08:28:51.243Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog_ip.py:27: in <module>
[2022-03-09T08:28:51.243Z] from ._linprog_util import _postsolve
[2022-03-09T08:28:51.243Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog_util.py:9: in <module>
[2022-03-09T08:28:51.243Z] from scipy.optimize._remove_redundancy import (
[2022-03-09T08:28:51.243Z] /usr/lib/python3.10/site-packages/scipy/optimize/_remove_redundancy.py:9: in <module>
[2022-03-09T08:28:51.243Z] from scipy.linalg.interpolative import interp_decomp
[2022-03-09T08:28:51.243Z] /usr/lib/python3.10/site-packages/scipy/linalg/interpolative.py:385: in <module>
[2022-03-09T08:28:51.243Z] import scipy.linalg._interpolative_backend as _backend
[2022-03-09T08:28:51.243Z] _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
[2022-03-09T08:28:51.243Z]
[2022-03-09T08:28:51.243Z] #******************************************************************************
[2022-03-09T08:28:51.243Z] # Copyright (C) 2013 Kenneth L. Ho
[2022-03-09T08:28:51.243Z] #
[2022-03-09T08:28:51.243Z] # Redistribution and use in source and binary forms, with or without
[2022-03-09T08:28:51.243Z] # modification, are permitted provided that the following conditions are met:
[2022-03-09T08:28:51.243Z] #
[2022-03-09T08:28:51.243Z] # Redistributions of source code must retain the above copyright notice, this
[2022-03-09T08:28:51.243Z] # list of conditions and the following disclaimer. Redistributions in binary
[2022-03-09T08:28:51.243Z] # form must reproduce the above copyright notice, this list of conditions and
[2022-03-09T08:28:51.243Z] # the following disclaimer in the documentation and/or other materials
[2022-03-09T08:28:51.243Z] # provided with the distribution.
[2022-03-09T08:28:51.243Z] #
[2022-03-09T08:28:51.243Z] # None of the names of the copyright holders may be used to endorse or
[2022-03-09T08:28:51.243Z] # promote products derived from this software without specific prior written
[2022-03-09T08:28:51.243Z] # permission.
[2022-03-09T08:28:51.243Z] #
[2022-03-09T08:28:51.243Z] # THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
[2022-03-09T08:28:51.243Z] # AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
[2022-03-09T08:28:51.243Z] # IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
[2022-03-09T08:28:51.243Z] # ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
[2022-03-09T08:28:51.243Z] # LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
[2022-03-09T08:28:51.243Z] # CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
[2022-03-09T08:28:51.243Z] # SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
[2022-03-09T08:28:51.243Z] # INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
[2022-03-09T08:28:51.243Z] # CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
[2022-03-09T08:28:51.243Z] # ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
[2022-03-09T08:28:51.243Z] # POSSIBILITY OF SUCH DAMAGE.
[2022-03-09T08:28:51.243Z] #******************************************************************************
[2022-03-09T08:28:51.243Z]
[2022-03-09T08:28:51.243Z] """
[2022-03-09T08:28:51.243Z] Direct wrappers for Fortran `id_dist` backend.
[2022-03-09T08:28:51.243Z] """
[2022-03-09T08:28:51.243Z]
[2022-03-09T08:28:51.243Z] > import scipy.linalg._interpolative as _id
[2022-03-09T08:28:51.243Z] E ImportError: /usr/lib/python3.10/site-packages/scipy/linalg/_interpolative.cpython-310-x86_64-linux-gnu.so: undefined symbol: _ZGVbN2v_sin
[2022-03-09T08:28:51.243Z]
[2022-03-09T08:28:51.243Z] /usr/lib/python3.10/site-packages/scipy/linalg/_interpolative_backend.py:34: ImportError
[2022-03-09T08:28:51.243Z] ________________________ TestSimilarity.test_selfloops _________________________
[2022-03-09T08:28:51.243Z]
[2022-03-09T08:28:51.243Z] self = <networkx.algorithms.tests.test_similarity.TestSimilarity object at 0x7fe884db2b30>
[2022-03-09T08:28:51.243Z]
[2022-03-09T08:28:51.243Z] def test_selfloops(self):
[2022-03-09T08:28:51.243Z] G0 = nx.Graph()
[2022-03-09T08:28:51.243Z] G1 = nx.Graph()
[2022-03-09T08:28:51.243Z] G1.add_edges_from((("A", "A"), ("A", "B")))
[2022-03-09T08:28:51.243Z] G2 = nx.Graph()
[2022-03-09T08:28:51.243Z] G2.add_edges_from((("A", "B"), ("B", "B")))
[2022-03-09T08:28:51.243Z] G3 = nx.Graph()
[2022-03-09T08:28:51.243Z] G3.add_edges_from((("A", "A"), ("A", "B"), ("B", "B")))
[2022-03-09T08:28:51.243Z]
[2022-03-09T08:28:51.243Z] > assert graph_edit_distance(G0, G0) == 0
[2022-03-09T08:28:51.243Z]
[2022-03-09T08:28:51.243Z] networkx/algorithms/tests/test_similarity.py:261:
[2022-03-09T08:28:51.243Z] _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
[2022-03-09T08:28:51.243Z] networkx/algorithms/similarity.py:190: in graph_edit_distance
[2022-03-09T08:28:51.243Z] for vertex_path, edge_path, cost in optimize_edit_paths(
[2022-03-09T08:28:51.243Z] networkx/algorithms/similarity.py:673: in optimize_edit_paths
[2022-03-09T08:28:51.243Z] import scipy.optimize # call as sp.optimize
[2022-03-09T08:28:51.243Z] /usr/lib/python3.10/site-packages/scipy/optimize/__init__.py:412: in <module>
[2022-03-09T08:28:51.243Z] from ._linprog import linprog, linprog_verbose_callback
[2022-03-09T08:28:51.243Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog.py:23: in <module>
[2022-03-09T08:28:51.243Z] from ._linprog_ip import _linprog_ip
[2022-03-09T08:28:51.243Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog_ip.py:27: in <module>
[2022-03-09T08:28:51.243Z] from ._linprog_util import _postsolve
[2022-03-09T08:28:51.244Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog_util.py:9: in <module>
[2022-03-09T08:28:51.244Z] from scipy.optimize._remove_redundancy import (
[2022-03-09T08:28:51.244Z] /usr/lib/python3.10/site-packages/scipy/optimize/_remove_redundancy.py:9: in <module>
[2022-03-09T08:28:51.244Z] from scipy.linalg.interpolative import interp_decomp
[2022-03-09T08:28:51.244Z] /usr/lib/python3.10/site-packages/scipy/linalg/interpolative.py:385: in <module>
[2022-03-09T08:28:51.244Z] import scipy.linalg._interpolative_backend as _backend
[2022-03-09T08:28:51.244Z] _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
[2022-03-09T08:28:51.244Z]
[2022-03-09T08:28:51.244Z] #******************************************************************************
[2022-03-09T08:28:51.244Z] # Copyright (C) 2013 Kenneth L. Ho
[2022-03-09T08:28:51.244Z] #
[2022-03-09T08:28:51.244Z] # Redistribution and use in source and binary forms, with or without
[2022-03-09T08:28:51.244Z] # modification, are permitted provided that the following conditions are met:
[2022-03-09T08:28:51.244Z] #
[2022-03-09T08:28:51.244Z] # Redistributions of source code must retain the above copyright notice, this
[2022-03-09T08:28:51.244Z] # list of conditions and the following disclaimer. Redistributions in binary
[2022-03-09T08:28:51.244Z] # form must reproduce the above copyright notice, this list of conditions and
[2022-03-09T08:28:51.244Z] # the following disclaimer in the documentation and/or other materials
[2022-03-09T08:28:51.244Z] # provided with the distribution.
[2022-03-09T08:28:51.244Z] #
[2022-03-09T08:28:51.244Z] # None of the names of the copyright holders may be used to endorse or
[2022-03-09T08:28:51.244Z] # promote products derived from this software without specific prior written
[2022-03-09T08:28:51.244Z] # permission.
[2022-03-09T08:28:51.244Z] #
[2022-03-09T08:28:51.244Z] # THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
[2022-03-09T08:28:51.244Z] # AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
[2022-03-09T08:28:51.244Z] # IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
[2022-03-09T08:28:51.244Z] # ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
[2022-03-09T08:28:51.244Z] # LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
[2022-03-09T08:28:51.244Z] # CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
[2022-03-09T08:28:51.244Z] # SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
[2022-03-09T08:28:51.244Z] # INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
[2022-03-09T08:28:51.244Z] # CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
[2022-03-09T08:28:51.244Z] # ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
[2022-03-09T08:28:51.244Z] # POSSIBILITY OF SUCH DAMAGE.
[2022-03-09T08:28:51.244Z] #******************************************************************************
[2022-03-09T08:28:51.244Z]
[2022-03-09T08:28:51.244Z] """
[2022-03-09T08:28:51.244Z] Direct wrappers for Fortran `id_dist` backend.
[2022-03-09T08:28:51.244Z] """
[2022-03-09T08:28:51.244Z]
[2022-03-09T08:28:51.244Z] > import scipy.linalg._interpolative as _id
[2022-03-09T08:28:51.244Z] E ImportError: /usr/lib/python3.10/site-packages/scipy/linalg/_interpolative.cpython-310-x86_64-linux-gnu.so: undefined symbol: _ZGVbN2v_sin
[2022-03-09T08:28:51.244Z]
[2022-03-09T08:28:51.244Z] /usr/lib/python3.10/site-packages/scipy/linalg/_interpolative_backend.py:34: ImportError
[2022-03-09T08:28:51.244Z] _________________________ TestSimilarity.test_digraph __________________________
[2022-03-09T08:28:51.244Z]
[2022-03-09T08:28:51.244Z] self = <networkx.algorithms.tests.test_similarity.TestSimilarity object at 0x7fe884db12a0>
[2022-03-09T08:28:51.244Z]
[2022-03-09T08:28:51.244Z] def test_digraph(self):
[2022-03-09T08:28:51.244Z] G0 = nx.DiGraph()
[2022-03-09T08:28:51.244Z] G1 = nx.DiGraph()
[2022-03-09T08:28:51.244Z] G1.add_edges_from((("A", "B"), ("B", "C"), ("C", "D"), ("D", "A")))
[2022-03-09T08:28:51.244Z] G2 = nx.DiGraph()
[2022-03-09T08:28:51.244Z] G2.add_edges_from((("A", "B"), ("B", "C"), ("C", "D"), ("A", "D")))
[2022-03-09T08:28:51.244Z] G3 = nx.DiGraph()
[2022-03-09T08:28:51.244Z] G3.add_edges_from((("A", "B"), ("A", "C"), ("B", "D"), ("C", "D")))
[2022-03-09T08:28:51.244Z]
[2022-03-09T08:28:51.244Z] > assert graph_edit_distance(G0, G0) == 0
[2022-03-09T08:28:51.244Z]
[2022-03-09T08:28:51.244Z] networkx/algorithms/tests/test_similarity.py:290:
[2022-03-09T08:28:51.244Z] _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
[2022-03-09T08:28:51.244Z] networkx/algorithms/similarity.py:190: in graph_edit_distance
[2022-03-09T08:28:51.244Z] for vertex_path, edge_path, cost in optimize_edit_paths(
[2022-03-09T08:28:51.244Z] networkx/algorithms/similarity.py:673: in optimize_edit_paths
[2022-03-09T08:28:51.244Z] import scipy.optimize # call as sp.optimize
[2022-03-09T08:28:51.244Z] /usr/lib/python3.10/site-packages/scipy/optimize/__init__.py:412: in <module>
[2022-03-09T08:28:51.244Z] from ._linprog import linprog, linprog_verbose_callback
[2022-03-09T08:28:51.244Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog.py:23: in <module>
[2022-03-09T08:28:51.244Z] from ._linprog_ip import _linprog_ip
[2022-03-09T08:28:51.244Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog_ip.py:27: in <module>
[2022-03-09T08:28:51.244Z] from ._linprog_util import _postsolve
[2022-03-09T08:28:51.244Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog_util.py:9: in <module>
[2022-03-09T08:28:51.244Z] from scipy.optimize._remove_redundancy import (
[2022-03-09T08:28:51.245Z] /usr/lib/python3.10/site-packages/scipy/optimize/_remove_redundancy.py:9: in <module>
[2022-03-09T08:28:51.245Z] from scipy.linalg.interpolative import interp_decomp
[2022-03-09T08:28:51.245Z] /usr/lib/python3.10/site-packages/scipy/linalg/interpolative.py:385: in <module>
[2022-03-09T08:28:51.245Z] import scipy.linalg._interpolative_backend as _backend
[2022-03-09T08:28:51.245Z] _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
[2022-03-09T08:28:51.245Z]
[2022-03-09T08:28:51.245Z] #******************************************************************************
[2022-03-09T08:28:51.245Z] # Copyright (C) 2013 Kenneth L. Ho
[2022-03-09T08:28:51.245Z] #
[2022-03-09T08:28:51.245Z] # Redistribution and use in source and binary forms, with or without
[2022-03-09T08:28:51.245Z] # modification, are permitted provided that the following conditions are met:
[2022-03-09T08:28:51.245Z] #
[2022-03-09T08:28:51.245Z] # Redistributions of source code must retain the above copyright notice, this
[2022-03-09T08:28:51.245Z] # list of conditions and the following disclaimer. Redistributions in binary
[2022-03-09T08:28:51.245Z] # form must reproduce the above copyright notice, this list of conditions and
[2022-03-09T08:28:51.245Z] # the following disclaimer in the documentation and/or other materials
[2022-03-09T08:28:51.245Z] # provided with the distribution.
[2022-03-09T08:28:51.245Z] #
[2022-03-09T08:28:51.245Z] # None of the names of the copyright holders may be used to endorse or
[2022-03-09T08:28:51.245Z] # promote products derived from this software without specific prior written
[2022-03-09T08:28:51.245Z] # permission.
[2022-03-09T08:28:51.245Z] #
[2022-03-09T08:28:51.245Z] # THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
[2022-03-09T08:28:51.245Z] # AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
[2022-03-09T08:28:51.245Z] # IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
[2022-03-09T08:28:51.245Z] # ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
[2022-03-09T08:28:51.245Z] # LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
[2022-03-09T08:28:51.245Z] # CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
[2022-03-09T08:28:51.245Z] # SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
[2022-03-09T08:28:51.245Z] # INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
[2022-03-09T08:28:51.245Z] # CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
[2022-03-09T08:28:51.245Z] # ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
[2022-03-09T08:28:51.245Z] # POSSIBILITY OF SUCH DAMAGE.
[2022-03-09T08:28:51.245Z] #******************************************************************************
[2022-03-09T08:28:51.245Z]
[2022-03-09T08:28:51.245Z] """
[2022-03-09T08:28:51.245Z] Direct wrappers for Fortran `id_dist` backend.
[2022-03-09T08:28:51.245Z] """
[2022-03-09T08:28:51.245Z]
[2022-03-09T08:28:51.245Z] > import scipy.linalg._interpolative as _id
[2022-03-09T08:28:51.245Z] E ImportError: /usr/lib/python3.10/site-packages/scipy/linalg/_interpolative.cpython-310-x86_64-linux-gnu.so: undefined symbol: _ZGVbN2v_sin
[2022-03-09T08:28:51.245Z]
[2022-03-09T08:28:51.245Z] /usr/lib/python3.10/site-packages/scipy/linalg/_interpolative_backend.py:34: ImportError
[2022-03-09T08:28:51.245Z] ________________________ TestSimilarity.test_multigraph ________________________
[2022-03-09T08:28:51.245Z]
[2022-03-09T08:28:51.245Z] self = <networkx.algorithms.tests.test_similarity.TestSimilarity object at 0x7fe884db1210>
[2022-03-09T08:28:51.245Z]
[2022-03-09T08:28:51.245Z] def test_multigraph(self):
[2022-03-09T08:28:51.245Z] G0 = nx.MultiGraph()
[2022-03-09T08:28:51.245Z] G1 = nx.MultiGraph()
[2022-03-09T08:28:51.245Z] G1.add_edges_from((("A", "B"), ("B", "C"), ("A", "C")))
[2022-03-09T08:28:51.245Z] G2 = nx.MultiGraph()
[2022-03-09T08:28:51.245Z] G2.add_edges_from((("A", "B"), ("B", "C"), ("B", "C"), ("A", "C")))
[2022-03-09T08:28:51.245Z] G3 = nx.MultiGraph()
[2022-03-09T08:28:51.245Z] G3.add_edges_from((("A", "B"), ("B", "C"), ("A", "C"), ("A", "C"), ("A", "C")))
[2022-03-09T08:28:51.245Z]
[2022-03-09T08:28:51.245Z] > assert graph_edit_distance(G0, G0) == 0
[2022-03-09T08:28:51.245Z]
[2022-03-09T08:28:51.245Z] networkx/algorithms/tests/test_similarity.py:319:
[2022-03-09T08:28:51.245Z] _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
[2022-03-09T08:28:51.245Z] networkx/algorithms/similarity.py:190: in graph_edit_distance
[2022-03-09T08:28:51.245Z] for vertex_path, edge_path, cost in optimize_edit_paths(
[2022-03-09T08:28:51.245Z] networkx/algorithms/similarity.py:673: in optimize_edit_paths
[2022-03-09T08:28:51.245Z] import scipy.optimize # call as sp.optimize
[2022-03-09T08:28:51.245Z] /usr/lib/python3.10/site-packages/scipy/optimize/__init__.py:412: in <module>
[2022-03-09T08:28:51.245Z] from ._linprog import linprog, linprog_verbose_callback
[2022-03-09T08:28:51.245Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog.py:23: in <module>
[2022-03-09T08:28:51.245Z] from ._linprog_ip import _linprog_ip
[2022-03-09T08:28:51.245Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog_ip.py:27: in <module>
[2022-03-09T08:28:51.245Z] from ._linprog_util import _postsolve
[2022-03-09T08:28:51.245Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog_util.py:9: in <module>
[2022-03-09T08:28:51.245Z] from scipy.optimize._remove_redundancy import (
[2022-03-09T08:28:51.245Z] /usr/lib/python3.10/site-packages/scipy/optimize/_remove_redundancy.py:9: in <module>
[2022-03-09T08:28:51.246Z] from scipy.linalg.interpolative import interp_decomp
[2022-03-09T08:28:51.246Z] /usr/lib/python3.10/site-packages/scipy/linalg/interpolative.py:385: in <module>
[2022-03-09T08:28:51.246Z] import scipy.linalg._interpolative_backend as _backend
[2022-03-09T08:28:51.246Z] _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
[2022-03-09T08:28:51.246Z]
[2022-03-09T08:28:51.246Z] #******************************************************************************
[2022-03-09T08:28:51.246Z] # Copyright (C) 2013 Kenneth L. Ho
[2022-03-09T08:28:51.246Z] #
[2022-03-09T08:28:51.246Z] # Redistribution and use in source and binary forms, with or without
[2022-03-09T08:28:51.246Z] # modification, are permitted provided that the following conditions are met:
[2022-03-09T08:28:51.246Z] #
[2022-03-09T08:28:51.246Z] # Redistributions of source code must retain the above copyright notice, this
[2022-03-09T08:28:51.246Z] # list of conditions and the following disclaimer. Redistributions in binary
[2022-03-09T08:28:51.246Z] # form must reproduce the above copyright notice, this list of conditions and
[2022-03-09T08:28:51.246Z] # the following disclaimer in the documentation and/or other materials
[2022-03-09T08:28:51.246Z] # provided with the distribution.
[2022-03-09T08:28:51.246Z] #
[2022-03-09T08:28:51.246Z] # None of the names of the copyright holders may be used to endorse or
[2022-03-09T08:28:51.246Z] # promote products derived from this software without specific prior written
[2022-03-09T08:28:51.246Z] # permission.
[2022-03-09T08:28:51.246Z] #
[2022-03-09T08:28:51.246Z] # THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
[2022-03-09T08:28:51.246Z] # AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
[2022-03-09T08:28:51.246Z] # IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
[2022-03-09T08:28:51.246Z] # ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
[2022-03-09T08:28:51.246Z] # LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
[2022-03-09T08:28:51.246Z] # CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
[2022-03-09T08:28:51.246Z] # SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
[2022-03-09T08:28:51.246Z] # INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
[2022-03-09T08:28:51.246Z] # CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
[2022-03-09T08:28:51.246Z] # ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
[2022-03-09T08:28:51.246Z] # POSSIBILITY OF SUCH DAMAGE.
[2022-03-09T08:28:51.246Z] #******************************************************************************
[2022-03-09T08:28:51.246Z]
[2022-03-09T08:28:51.246Z] """
[2022-03-09T08:28:51.246Z] Direct wrappers for Fortran `id_dist` backend.
[2022-03-09T08:28:51.246Z] """
[2022-03-09T08:28:51.246Z]
[2022-03-09T08:28:51.246Z] > import scipy.linalg._interpolative as _id
[2022-03-09T08:28:51.246Z] E ImportError: /usr/lib/python3.10/site-packages/scipy/linalg/_interpolative.cpython-310-x86_64-linux-gnu.so: undefined symbol: _ZGVbN2v_sin
[2022-03-09T08:28:51.246Z]
[2022-03-09T08:28:51.246Z] /usr/lib/python3.10/site-packages/scipy/linalg/_interpolative_backend.py:34: ImportError
[2022-03-09T08:28:51.246Z] _______________________ TestSimilarity.test_multidigraph _______________________
[2022-03-09T08:28:51.246Z]
[2022-03-09T08:28:51.246Z] self = <networkx.algorithms.tests.test_similarity.TestSimilarity object at 0x7fe884db1750>
[2022-03-09T08:28:51.246Z]
[2022-03-09T08:28:51.246Z] def test_multidigraph(self):
[2022-03-09T08:28:51.246Z] G1 = nx.MultiDiGraph()
[2022-03-09T08:28:51.246Z] G1.add_edges_from(
[2022-03-09T08:28:51.246Z] (
[2022-03-09T08:28:51.246Z] ("hardware", "kernel"),
[2022-03-09T08:28:51.246Z] ("kernel", "hardware"),
[2022-03-09T08:28:51.246Z] ("kernel", "userspace"),
[2022-03-09T08:28:51.246Z] ("userspace", "kernel"),
[2022-03-09T08:28:51.246Z] )
[2022-03-09T08:28:51.246Z] )
[2022-03-09T08:28:51.246Z] G2 = nx.MultiDiGraph()
[2022-03-09T08:28:51.246Z] G2.add_edges_from(
[2022-03-09T08:28:51.246Z] (
[2022-03-09T08:28:51.246Z] ("winter", "spring"),
[2022-03-09T08:28:51.246Z] ("spring", "summer"),
[2022-03-09T08:28:51.246Z] ("summer", "autumn"),
[2022-03-09T08:28:51.246Z] ("autumn", "winter"),
[2022-03-09T08:28:51.246Z] )
[2022-03-09T08:28:51.246Z] )
[2022-03-09T08:28:51.246Z]
[2022-03-09T08:28:51.246Z] > assert graph_edit_distance(G1, G2) == 5
[2022-03-09T08:28:51.246Z]
[2022-03-09T08:28:51.246Z] networkx/algorithms/tests/test_similarity.py:359:
[2022-03-09T08:28:51.246Z] _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
[2022-03-09T08:28:51.246Z] networkx/algorithms/similarity.py:190: in graph_edit_distance
[2022-03-09T08:28:51.246Z] for vertex_path, edge_path, cost in optimize_edit_paths(
[2022-03-09T08:28:51.246Z] networkx/algorithms/similarity.py:673: in optimize_edit_paths
[2022-03-09T08:28:51.246Z] import scipy.optimize # call as sp.optimize
[2022-03-09T08:28:51.246Z] /usr/lib/python3.10/site-packages/scipy/optimize/__init__.py:412: in <module>
[2022-03-09T08:28:51.246Z] from ._linprog import linprog, linprog_verbose_callback
[2022-03-09T08:28:51.246Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog.py:23: in <module>
[2022-03-09T08:28:51.246Z] from ._linprog_ip import _linprog_ip
[2022-03-09T08:28:51.246Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog_ip.py:27: in <module>
[2022-03-09T08:28:51.246Z] from ._linprog_util import _postsolve
[2022-03-09T08:28:51.246Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog_util.py:9: in <module>
[2022-03-09T08:28:51.246Z] from scipy.optimize._remove_redundancy import (
[2022-03-09T08:28:51.247Z] /usr/lib/python3.10/site-packages/scipy/optimize/_remove_redundancy.py:9: in <module>
[2022-03-09T08:28:51.247Z] from scipy.linalg.interpolative import interp_decomp
[2022-03-09T08:28:51.247Z] /usr/lib/python3.10/site-packages/scipy/linalg/interpolative.py:385: in <module>
[2022-03-09T08:28:51.247Z] import scipy.linalg._interpolative_backend as _backend
[2022-03-09T08:28:51.247Z] _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
[2022-03-09T08:28:51.247Z]
[2022-03-09T08:28:51.247Z] #******************************************************************************
[2022-03-09T08:28:51.247Z] # Copyright (C) 2013 Kenneth L. Ho
[2022-03-09T08:28:51.247Z] #
[2022-03-09T08:28:51.247Z] # Redistribution and use in source and binary forms, with or without
[2022-03-09T08:28:51.247Z] # modification, are permitted provided that the following conditions are met:
[2022-03-09T08:28:51.247Z] #
[2022-03-09T08:28:51.247Z] # Redistributions of source code must retain the above copyright notice, this
[2022-03-09T08:28:51.247Z] # list of conditions and the following disclaimer. Redistributions in binary
[2022-03-09T08:28:51.247Z] # form must reproduce the above copyright notice, this list of conditions and
[2022-03-09T08:28:51.247Z] # the following disclaimer in the documentation and/or other materials
[2022-03-09T08:28:51.247Z] # provided with the distribution.
[2022-03-09T08:28:51.247Z] #
[2022-03-09T08:28:51.247Z] # None of the names of the copyright holders may be used to endorse or
[2022-03-09T08:28:51.247Z] # promote products derived from this software without specific prior written
[2022-03-09T08:28:51.247Z] # permission.
[2022-03-09T08:28:51.247Z] #
[2022-03-09T08:28:51.247Z] # THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
[2022-03-09T08:28:51.247Z] # AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
[2022-03-09T08:28:51.247Z] # IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
[2022-03-09T08:28:51.247Z] # ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
[2022-03-09T08:28:51.247Z] # LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
[2022-03-09T08:28:51.247Z] # CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
[2022-03-09T08:28:51.247Z] # SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
[2022-03-09T08:28:51.247Z] # INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
[2022-03-09T08:28:51.247Z] # CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
[2022-03-09T08:28:51.247Z] # ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
[2022-03-09T08:28:51.247Z] # POSSIBILITY OF SUCH DAMAGE.
[2022-03-09T08:28:51.247Z] #******************************************************************************
[2022-03-09T08:28:51.247Z]
[2022-03-09T08:28:51.247Z] """
[2022-03-09T08:28:51.247Z] Direct wrappers for Fortran `id_dist` backend.
[2022-03-09T08:28:51.247Z] """
[2022-03-09T08:28:51.247Z]
[2022-03-09T08:28:51.247Z] > import scipy.linalg._interpolative as _id
[2022-03-09T08:28:51.247Z] E ImportError: /usr/lib/python3.10/site-packages/scipy/linalg/_interpolative.cpython-310-x86_64-linux-gnu.so: undefined symbol: _ZGVbN2v_sin
[2022-03-09T08:28:51.247Z]
[2022-03-09T08:28:51.247Z] /usr/lib/python3.10/site-packages/scipy/linalg/_interpolative_backend.py:34: ImportError
[2022-03-09T08:28:51.247Z] ___________________________ TestSimilarity.testCopy ____________________________
[2022-03-09T08:28:51.247Z]
[2022-03-09T08:28:51.247Z] self = <networkx.algorithms.tests.test_similarity.TestSimilarity object at 0x7fe884db1540>
[2022-03-09T08:28:51.247Z]
[2022-03-09T08:28:51.247Z] def testCopy(self):
[2022-03-09T08:28:51.247Z] G = nx.Graph()
[2022-03-09T08:28:51.247Z] G.add_node("A", label="A")
[2022-03-09T08:28:51.247Z] G.add_node("B", label="B")
[2022-03-09T08:28:51.247Z] G.add_edge("A", "B", label="a-b")
[2022-03-09T08:28:51.247Z] > assert (
[2022-03-09T08:28:51.247Z] graph_edit_distance(G, G.copy(), node_match=nmatch, edge_match=ematch) == 0
[2022-03-09T08:28:51.247Z] )
[2022-03-09T08:28:51.247Z]
[2022-03-09T08:28:51.247Z] networkx/algorithms/tests/test_similarity.py:368:
[2022-03-09T08:28:51.247Z] _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
[2022-03-09T08:28:51.247Z] networkx/algorithms/similarity.py:190: in graph_edit_distance
[2022-03-09T08:28:51.247Z] for vertex_path, edge_path, cost in optimize_edit_paths(
[2022-03-09T08:28:51.247Z] networkx/algorithms/similarity.py:673: in optimize_edit_paths
[2022-03-09T08:28:51.247Z] import scipy.optimize # call as sp.optimize
[2022-03-09T08:28:51.247Z] /usr/lib/python3.10/site-packages/scipy/optimize/__init__.py:412: in <module>
[2022-03-09T08:28:51.247Z] from ._linprog import linprog, linprog_verbose_callback
[2022-03-09T08:28:51.247Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog.py:23: in <module>
[2022-03-09T08:28:51.247Z] from ._linprog_ip import _linprog_ip
[2022-03-09T08:28:51.247Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog_ip.py:27: in <module>
[2022-03-09T08:28:51.247Z] from ._linprog_util import _postsolve
[2022-03-09T08:28:51.247Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog_util.py:9: in <module>
[2022-03-09T08:28:51.247Z] from scipy.optimize._remove_redundancy import (
[2022-03-09T08:28:51.247Z] /usr/lib/python3.10/site-packages/scipy/optimize/_remove_redundancy.py:9: in <module>
[2022-03-09T08:28:51.247Z] from scipy.linalg.interpolative import interp_decomp
[2022-03-09T08:28:51.247Z] /usr/lib/python3.10/site-packages/scipy/linalg/interpolative.py:385: in <module>
[2022-03-09T08:28:51.247Z] import scipy.linalg._interpolative_backend as _backend
[2022-03-09T08:28:51.248Z] _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
[2022-03-09T08:28:51.248Z]
[2022-03-09T08:28:51.248Z] #******************************************************************************
[2022-03-09T08:28:51.248Z] # Copyright (C) 2013 Kenneth L. Ho
[2022-03-09T08:28:51.248Z] #
[2022-03-09T08:28:51.248Z] # Redistribution and use in source and binary forms, with or without
[2022-03-09T08:28:51.248Z] # modification, are permitted provided that the following conditions are met:
[2022-03-09T08:28:51.248Z] #
[2022-03-09T08:28:51.248Z] # Redistributions of source code must retain the above copyright notice, this
[2022-03-09T08:28:51.248Z] # list of conditions and the following disclaimer. Redistributions in binary
[2022-03-09T08:28:51.248Z] # form must reproduce the above copyright notice, this list of conditions and
[2022-03-09T08:28:51.248Z] # the following disclaimer in the documentation and/or other materials
[2022-03-09T08:28:51.248Z] # provided with the distribution.
[2022-03-09T08:28:51.248Z] #
[2022-03-09T08:28:51.248Z] # None of the names of the copyright holders may be used to endorse or
[2022-03-09T08:28:51.248Z] # promote products derived from this software without specific prior written
[2022-03-09T08:28:51.248Z] # permission.
[2022-03-09T08:28:51.248Z] #
[2022-03-09T08:28:51.248Z] # THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
[2022-03-09T08:28:51.248Z] # AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
[2022-03-09T08:28:51.248Z] # IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
[2022-03-09T08:28:51.248Z] # ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
[2022-03-09T08:28:51.248Z] # LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
[2022-03-09T08:28:51.248Z] # CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
[2022-03-09T08:28:51.248Z] # SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
[2022-03-09T08:28:51.248Z] # INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
[2022-03-09T08:28:51.248Z] # CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
[2022-03-09T08:28:51.248Z] # ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
[2022-03-09T08:28:51.248Z] # POSSIBILITY OF SUCH DAMAGE.
[2022-03-09T08:28:51.248Z] #******************************************************************************
[2022-03-09T08:28:51.248Z]
[2022-03-09T08:28:51.248Z] """
[2022-03-09T08:28:51.248Z] Direct wrappers for Fortran `id_dist` backend.
[2022-03-09T08:28:51.248Z] """
[2022-03-09T08:28:51.248Z]
[2022-03-09T08:28:51.248Z] > import scipy.linalg._interpolative as _id
[2022-03-09T08:28:51.248Z] E ImportError: /usr/lib/python3.10/site-packages/scipy/linalg/_interpolative.cpython-310-x86_64-linux-gnu.so: undefined symbol: _ZGVbN2v_sin
[2022-03-09T08:28:51.248Z]
[2022-03-09T08:28:51.248Z] /usr/lib/python3.10/site-packages/scipy/linalg/_interpolative_backend.py:34: ImportError
[2022-03-09T08:28:51.248Z] ___________________________ TestSimilarity.testSame ____________________________
[2022-03-09T08:28:51.248Z]
[2022-03-09T08:28:51.248Z] self = <networkx.algorithms.tests.test_similarity.TestSimilarity object at 0x7fe884db1bd0>
[2022-03-09T08:28:51.248Z]
[2022-03-09T08:28:51.248Z] def testSame(self):
[2022-03-09T08:28:51.248Z] G1 = nx.Graph()
[2022-03-09T08:28:51.248Z] G1.add_node("A", label="A")
[2022-03-09T08:28:51.248Z] G1.add_node("B", label="B")
[2022-03-09T08:28:51.248Z] G1.add_edge("A", "B", label="a-b")
[2022-03-09T08:28:51.248Z] G2 = nx.Graph()
[2022-03-09T08:28:51.248Z] G2.add_node("A", label="A")
[2022-03-09T08:28:51.248Z] G2.add_node("B", label="B")
[2022-03-09T08:28:51.248Z] G2.add_edge("A", "B", label="a-b")
[2022-03-09T08:28:51.248Z] > assert graph_edit_distance(G1, G2, node_match=nmatch, edge_match=ematch) == 0
[2022-03-09T08:28:51.248Z]
[2022-03-09T08:28:51.248Z] networkx/algorithms/tests/test_similarity.py:381:
[2022-03-09T08:28:51.248Z] _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
[2022-03-09T08:28:51.248Z] networkx/algorithms/similarity.py:190: in graph_edit_distance
[2022-03-09T08:28:51.248Z] for vertex_path, edge_path, cost in optimize_edit_paths(
[2022-03-09T08:28:51.248Z] networkx/algorithms/similarity.py:673: in optimize_edit_paths
[2022-03-09T08:28:51.248Z] import scipy.optimize # call as sp.optimize
[2022-03-09T08:28:51.248Z] /usr/lib/python3.10/site-packages/scipy/optimize/__init__.py:412: in <module>
[2022-03-09T08:28:51.248Z] from ._linprog import linprog, linprog_verbose_callback
[2022-03-09T08:28:51.248Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog.py:23: in <module>
[2022-03-09T08:28:51.248Z] from ._linprog_ip import _linprog_ip
[2022-03-09T08:28:51.248Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog_ip.py:27: in <module>
[2022-03-09T08:28:51.248Z] from ._linprog_util import _postsolve
[2022-03-09T08:28:51.248Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog_util.py:9: in <module>
[2022-03-09T08:28:51.248Z] from scipy.optimize._remove_redundancy import (
[2022-03-09T08:28:51.248Z] /usr/lib/python3.10/site-packages/scipy/optimize/_remove_redundancy.py:9: in <module>
[2022-03-09T08:28:51.248Z] from scipy.linalg.interpolative import interp_decomp
[2022-03-09T08:28:51.248Z] /usr/lib/python3.10/site-packages/scipy/linalg/interpolative.py:385: in <module>
[2022-03-09T08:28:51.249Z] import scipy.linalg._interpolative_backend as _backend
[2022-03-09T08:28:51.249Z] _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
[2022-03-09T08:28:51.249Z]
[2022-03-09T08:28:51.249Z] #******************************************************************************
[2022-03-09T08:28:51.249Z] # Copyright (C) 2013 Kenneth L. Ho
[2022-03-09T08:28:51.249Z] #
[2022-03-09T08:28:51.249Z] # Redistribution and use in source and binary forms, with or without
[2022-03-09T08:28:51.249Z] # modification, are permitted provided that the following conditions are met:
[2022-03-09T08:28:51.249Z] #
[2022-03-09T08:28:51.249Z] # Redistributions of source code must retain the above copyright notice, this
[2022-03-09T08:28:51.249Z] # list of conditions and the following disclaimer. Redistributions in binary
[2022-03-09T08:28:51.249Z] # form must reproduce the above copyright notice, this list of conditions and
[2022-03-09T08:28:51.249Z] # the following disclaimer in the documentation and/or other materials
[2022-03-09T08:28:51.249Z] # provided with the distribution.
[2022-03-09T08:28:51.249Z] #
[2022-03-09T08:28:51.249Z] # None of the names of the copyright holders may be used to endorse or
[2022-03-09T08:28:51.249Z] # promote products derived from this software without specific prior written
[2022-03-09T08:28:51.249Z] # permission.
[2022-03-09T08:28:51.249Z] #
[2022-03-09T08:28:51.249Z] # THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
[2022-03-09T08:28:51.249Z] # AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
[2022-03-09T08:28:51.249Z] # IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
[2022-03-09T08:28:51.249Z] # ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
[2022-03-09T08:28:51.249Z] # LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
[2022-03-09T08:28:51.249Z] # CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
[2022-03-09T08:28:51.249Z] # SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
[2022-03-09T08:28:51.249Z] # INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
[2022-03-09T08:28:51.249Z] # CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
[2022-03-09T08:28:51.249Z] # ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
[2022-03-09T08:28:51.249Z] # POSSIBILITY OF SUCH DAMAGE.
[2022-03-09T08:28:51.249Z] #******************************************************************************
[2022-03-09T08:28:51.249Z]
[2022-03-09T08:28:51.249Z] """
[2022-03-09T08:28:51.249Z] Direct wrappers for Fortran `id_dist` backend.
[2022-03-09T08:28:51.249Z] """
[2022-03-09T08:28:51.249Z]
[2022-03-09T08:28:51.249Z] > import scipy.linalg._interpolative as _id
[2022-03-09T08:28:51.249Z] E ImportError: /usr/lib/python3.10/site-packages/scipy/linalg/_interpolative.cpython-310-x86_64-linux-gnu.so: undefined symbol: _ZGVbN2v_sin
[2022-03-09T08:28:51.249Z]
[2022-03-09T08:28:51.249Z] /usr/lib/python3.10/site-packages/scipy/linalg/_interpolative_backend.py:34: ImportError
[2022-03-09T08:28:51.249Z] _____________________ TestSimilarity.testOneEdgeLabelDiff ______________________
[2022-03-09T08:28:51.249Z]
[2022-03-09T08:28:51.249Z] self = <networkx.algorithms.tests.test_similarity.TestSimilarity object at 0x7fe884db1870>
[2022-03-09T08:28:51.249Z]
[2022-03-09T08:28:51.249Z] def testOneEdgeLabelDiff(self):
[2022-03-09T08:28:51.249Z] G1 = nx.Graph()
[2022-03-09T08:28:51.249Z] G1.add_node("A", label="A")
[2022-03-09T08:28:51.249Z] G1.add_node("B", label="B")
[2022-03-09T08:28:51.249Z] G1.add_edge("A", "B", label="a-b")
[2022-03-09T08:28:51.249Z] G2 = nx.Graph()
[2022-03-09T08:28:51.249Z] G2.add_node("A", label="A")
[2022-03-09T08:28:51.249Z] G2.add_node("B", label="B")
[2022-03-09T08:28:51.249Z] G2.add_edge("A", "B", label="bad")
[2022-03-09T08:28:51.249Z] > assert graph_edit_distance(G1, G2, node_match=nmatch, edge_match=ematch) == 1
[2022-03-09T08:28:51.249Z]
[2022-03-09T08:28:51.249Z] networkx/algorithms/tests/test_similarity.py:392:
[2022-03-09T08:28:51.249Z] _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
[2022-03-09T08:28:51.249Z] networkx/algorithms/similarity.py:190: in graph_edit_distance
[2022-03-09T08:28:51.249Z] for vertex_path, edge_path, cost in optimize_edit_paths(
[2022-03-09T08:28:51.249Z] networkx/algorithms/similarity.py:673: in optimize_edit_paths
[2022-03-09T08:28:51.249Z] import scipy.optimize # call as sp.optimize
[2022-03-09T08:28:51.249Z] /usr/lib/python3.10/site-packages/scipy/optimize/__init__.py:412: in <module>
[2022-03-09T08:28:51.249Z] from ._linprog import linprog, linprog_verbose_callback
[2022-03-09T08:28:51.249Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog.py:23: in <module>
[2022-03-09T08:28:51.249Z] from ._linprog_ip import _linprog_ip
[2022-03-09T08:28:51.249Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog_ip.py:27: in <module>
[2022-03-09T08:28:51.249Z] from ._linprog_util import _postsolve
[2022-03-09T08:28:51.250Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog_util.py:9: in <module>
[2022-03-09T08:28:51.250Z] from scipy.optimize._remove_redundancy import (
[2022-03-09T08:28:51.250Z] /usr/lib/python3.10/site-packages/scipy/optimize/_remove_redundancy.py:9: in <module>
[2022-03-09T08:28:51.250Z] from scipy.linalg.interpolative import interp_decomp
[2022-03-09T08:28:51.250Z] /usr/lib/python3.10/site-packages/scipy/linalg/interpolative.py:385: in <module>
[2022-03-09T08:28:51.250Z] import scipy.linalg._interpolative_backend as _backend
[2022-03-09T08:28:51.250Z] _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
[2022-03-09T08:28:51.250Z]
[2022-03-09T08:28:51.250Z] #******************************************************************************
[2022-03-09T08:28:51.250Z] # Copyright (C) 2013 Kenneth L. Ho
[2022-03-09T08:28:51.250Z] #
[2022-03-09T08:28:51.250Z] # Redistribution and use in source and binary forms, with or without
[2022-03-09T08:28:51.250Z] # modification, are permitted provided that the following conditions are met:
[2022-03-09T08:28:51.250Z] #
[2022-03-09T08:28:51.250Z] # Redistributions of source code must retain the above copyright notice, this
[2022-03-09T08:28:51.250Z] # list of conditions and the following disclaimer. Redistributions in binary
[2022-03-09T08:28:51.250Z] # form must reproduce the above copyright notice, this list of conditions and
[2022-03-09T08:28:51.250Z] # the following disclaimer in the documentation and/or other materials
[2022-03-09T08:28:51.250Z] # provided with the distribution.
[2022-03-09T08:28:51.250Z] #
[2022-03-09T08:28:51.250Z] # None of the names of the copyright holders may be used to endorse or
[2022-03-09T08:28:51.250Z] # promote products derived from this software without specific prior written
[2022-03-09T08:28:51.250Z] # permission.
[2022-03-09T08:28:51.250Z] #
[2022-03-09T08:28:51.250Z] # THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
[2022-03-09T08:28:51.250Z] # AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
[2022-03-09T08:28:51.250Z] # IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
[2022-03-09T08:28:51.250Z] # ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
[2022-03-09T08:28:51.250Z] # LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
[2022-03-09T08:28:51.250Z] # CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
[2022-03-09T08:28:51.250Z] # SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
[2022-03-09T08:28:51.250Z] # INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
[2022-03-09T08:28:51.250Z] # CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
[2022-03-09T08:28:51.250Z] # ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
[2022-03-09T08:28:51.250Z] # POSSIBILITY OF SUCH DAMAGE.
[2022-03-09T08:28:51.250Z] #******************************************************************************
[2022-03-09T08:28:51.250Z]
[2022-03-09T08:28:51.250Z] """
[2022-03-09T08:28:51.250Z] Direct wrappers for Fortran `id_dist` backend.
[2022-03-09T08:28:51.250Z] """
[2022-03-09T08:28:51.250Z]
[2022-03-09T08:28:51.250Z] > import scipy.linalg._interpolative as _id
[2022-03-09T08:28:51.250Z] E ImportError: /usr/lib/python3.10/site-packages/scipy/linalg/_interpolative.cpython-310-x86_64-linux-gnu.so: undefined symbol: _ZGVbN2v_sin
[2022-03-09T08:28:51.250Z]
[2022-03-09T08:28:51.250Z] /usr/lib/python3.10/site-packages/scipy/linalg/_interpolative_backend.py:34: ImportError
[2022-03-09T08:28:51.250Z] _____________________ TestSimilarity.testOneNodeLabelDiff ______________________
[2022-03-09T08:28:51.250Z]
[2022-03-09T08:28:51.250Z] self = <networkx.algorithms.tests.test_similarity.TestSimilarity object at 0x7fe884db1e10>
[2022-03-09T08:28:51.250Z]
[2022-03-09T08:28:51.250Z] def testOneNodeLabelDiff(self):
[2022-03-09T08:28:51.250Z] G1 = nx.Graph()
[2022-03-09T08:28:51.250Z] G1.add_node("A", label="A")
[2022-03-09T08:28:51.250Z] G1.add_node("B", label="B")
[2022-03-09T08:28:51.250Z] G1.add_edge("A", "B", label="a-b")
[2022-03-09T08:28:51.250Z] G2 = nx.Graph()
[2022-03-09T08:28:51.250Z] G2.add_node("A", label="Z")
[2022-03-09T08:28:51.250Z] G2.add_node("B", label="B")
[2022-03-09T08:28:51.250Z] G2.add_edge("A", "B", label="a-b")
[2022-03-09T08:28:51.250Z] > assert graph_edit_distance(G1, G2, node_match=nmatch, edge_match=ematch) == 1
[2022-03-09T08:28:51.250Z]
[2022-03-09T08:28:51.250Z] networkx/algorithms/tests/test_similarity.py:403:
[2022-03-09T08:28:51.250Z] _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
[2022-03-09T08:28:51.250Z] networkx/algorithms/similarity.py:190: in graph_edit_distance
[2022-03-09T08:28:51.250Z] for vertex_path, edge_path, cost in optimize_edit_paths(
[2022-03-09T08:28:51.250Z] networkx/algorithms/similarity.py:673: in optimize_edit_paths
[2022-03-09T08:28:51.250Z] import scipy.optimize # call as sp.optimize
[2022-03-09T08:28:51.250Z] /usr/lib/python3.10/site-packages/scipy/optimize/__init__.py:412: in <module>
[2022-03-09T08:28:51.250Z] from ._linprog import linprog, linprog_verbose_callback
[2022-03-09T08:28:51.250Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog.py:23: in <module>
[2022-03-09T08:28:51.250Z] from ._linprog_ip import _linprog_ip
[2022-03-09T08:28:51.250Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog_ip.py:27: in <module>
[2022-03-09T08:28:51.250Z] from ._linprog_util import _postsolve
[2022-03-09T08:28:51.250Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog_util.py:9: in <module>
[2022-03-09T08:28:51.250Z] from scipy.optimize._remove_redundancy import (
[2022-03-09T08:28:51.250Z] /usr/lib/python3.10/site-packages/scipy/optimize/_remove_redundancy.py:9: in <module>
[2022-03-09T08:28:51.250Z] from scipy.linalg.interpolative import interp_decomp
[2022-03-09T08:28:51.250Z] /usr/lib/python3.10/site-packages/scipy/linalg/interpolative.py:385: in <module>
[2022-03-09T08:28:51.250Z] import scipy.linalg._interpolative_backend as _backend
[2022-03-09T08:28:51.250Z] _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
[2022-03-09T08:28:51.251Z]
[2022-03-09T08:28:51.251Z] #******************************************************************************
[2022-03-09T08:28:51.251Z] # Copyright (C) 2013 Kenneth L. Ho
[2022-03-09T08:28:51.251Z] #
[2022-03-09T08:28:51.251Z] # Redistribution and use in source and binary forms, with or without
[2022-03-09T08:28:51.251Z] # modification, are permitted provided that the following conditions are met:
[2022-03-09T08:28:51.251Z] #
[2022-03-09T08:28:51.251Z] # Redistributions of source code must retain the above copyright notice, this
[2022-03-09T08:28:51.251Z] # list of conditions and the following disclaimer. Redistributions in binary
[2022-03-09T08:28:51.251Z] # form must reproduce the above copyright notice, this list of conditions and
[2022-03-09T08:28:51.251Z] # the following disclaimer in the documentation and/or other materials
[2022-03-09T08:28:51.251Z] # provided with the distribution.
[2022-03-09T08:28:51.251Z] #
[2022-03-09T08:28:51.251Z] # None of the names of the copyright holders may be used to endorse or
[2022-03-09T08:28:51.251Z] # promote products derived from this software without specific prior written
[2022-03-09T08:28:51.251Z] # permission.
[2022-03-09T08:28:51.251Z] #
[2022-03-09T08:28:51.251Z] # THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
[2022-03-09T08:28:51.251Z] # AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
[2022-03-09T08:28:51.251Z] # IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
[2022-03-09T08:28:51.251Z] # ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
[2022-03-09T08:28:51.251Z] # LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
[2022-03-09T08:28:51.251Z] # CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
[2022-03-09T08:28:51.251Z] # SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
[2022-03-09T08:28:51.251Z] # INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
[2022-03-09T08:28:51.251Z] # CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
[2022-03-09T08:28:51.251Z] # ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
[2022-03-09T08:28:51.251Z] # POSSIBILITY OF SUCH DAMAGE.
[2022-03-09T08:28:51.251Z] #******************************************************************************
[2022-03-09T08:28:51.251Z]
[2022-03-09T08:28:51.251Z] """
[2022-03-09T08:28:51.251Z] Direct wrappers for Fortran `id_dist` backend.
[2022-03-09T08:28:51.251Z] """
[2022-03-09T08:28:51.251Z]
[2022-03-09T08:28:51.251Z] > import scipy.linalg._interpolative as _id
[2022-03-09T08:28:51.251Z] E ImportError: /usr/lib/python3.10/site-packages/scipy/linalg/_interpolative.cpython-310-x86_64-linux-gnu.so: undefined symbol: _ZGVbN2v_sin
[2022-03-09T08:28:51.251Z]
[2022-03-09T08:28:51.251Z] /usr/lib/python3.10/site-packages/scipy/linalg/_interpolative_backend.py:34: ImportError
[2022-03-09T08:28:51.251Z] _______________________ TestSimilarity.testOneExtraNode ________________________
[2022-03-09T08:28:51.251Z]
[2022-03-09T08:28:51.251Z] self = <networkx.algorithms.tests.test_similarity.TestSimilarity object at 0x7fe884db2230>
[2022-03-09T08:28:51.251Z]
[2022-03-09T08:28:51.251Z] def testOneExtraNode(self):
[2022-03-09T08:28:51.251Z] G1 = nx.Graph()
[2022-03-09T08:28:51.251Z] G1.add_node("A", label="A")
[2022-03-09T08:28:51.251Z] G1.add_node("B", label="B")
[2022-03-09T08:28:51.251Z] G1.add_edge("A", "B", label="a-b")
[2022-03-09T08:28:51.251Z] G2 = nx.Graph()
[2022-03-09T08:28:51.251Z] G2.add_node("A", label="A")
[2022-03-09T08:28:51.251Z] G2.add_node("B", label="B")
[2022-03-09T08:28:51.251Z] G2.add_edge("A", "B", label="a-b")
[2022-03-09T08:28:51.251Z] G2.add_node("C", label="C")
[2022-03-09T08:28:51.251Z] > assert graph_edit_distance(G1, G2, node_match=nmatch, edge_match=ematch) == 1
[2022-03-09T08:28:51.251Z]
[2022-03-09T08:28:51.251Z] networkx/algorithms/tests/test_similarity.py:415:
[2022-03-09T08:28:51.251Z] _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
[2022-03-09T08:28:51.251Z] networkx/algorithms/similarity.py:190: in graph_edit_distance
[2022-03-09T08:28:51.251Z] for vertex_path, edge_path, cost in optimize_edit_paths(
[2022-03-09T08:28:51.251Z] networkx/algorithms/similarity.py:673: in optimize_edit_paths
[2022-03-09T08:28:51.251Z] import scipy.optimize # call as sp.optimize
[2022-03-09T08:28:51.251Z] /usr/lib/python3.10/site-packages/scipy/optimize/__init__.py:412: in <module>
[2022-03-09T08:28:51.251Z] from ._linprog import linprog, linprog_verbose_callback
[2022-03-09T08:28:51.251Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog.py:23: in <module>
[2022-03-09T08:28:51.251Z] from ._linprog_ip import _linprog_ip
[2022-03-09T08:28:51.251Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog_ip.py:27: in <module>
[2022-03-09T08:28:51.251Z] from ._linprog_util import _postsolve
[2022-03-09T08:28:51.251Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog_util.py:9: in <module>
[2022-03-09T08:28:51.251Z] from scipy.optimize._remove_redundancy import (
[2022-03-09T08:28:51.251Z] /usr/lib/python3.10/site-packages/scipy/optimize/_remove_redundancy.py:9: in <module>
[2022-03-09T08:28:51.251Z] from scipy.linalg.interpolative import interp_decomp
[2022-03-09T08:28:51.251Z] /usr/lib/python3.10/site-packages/scipy/linalg/interpolative.py:385: in <module>
[2022-03-09T08:28:51.251Z] import scipy.linalg._interpolative_backend as _backend
[2022-03-09T08:28:51.251Z] _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
[2022-03-09T08:28:51.251Z]
[2022-03-09T08:28:51.251Z] #******************************************************************************
[2022-03-09T08:28:51.251Z] # Copyright (C) 2013 Kenneth L. Ho
[2022-03-09T08:28:51.251Z] #
[2022-03-09T08:28:51.251Z] # Redistribution and use in source and binary forms, with or without
[2022-03-09T08:28:51.251Z] # modification, are permitted provided that the following conditions are met:
[2022-03-09T08:28:51.251Z] #
[2022-03-09T08:28:51.251Z] # Redistributions of source code must retain the above copyright notice, this
[2022-03-09T08:28:51.251Z] # list of conditions and the following disclaimer. Redistributions in binary
[2022-03-09T08:28:51.252Z] # form must reproduce the above copyright notice, this list of conditions and
[2022-03-09T08:28:51.252Z] # the following disclaimer in the documentation and/or other materials
[2022-03-09T08:28:51.252Z] # provided with the distribution.
[2022-03-09T08:28:51.252Z] #
[2022-03-09T08:28:51.252Z] # None of the names of the copyright holders may be used to endorse or
[2022-03-09T08:28:51.252Z] # promote products derived from this software without specific prior written
[2022-03-09T08:28:51.252Z] # permission.
[2022-03-09T08:28:51.252Z] #
[2022-03-09T08:28:51.252Z] # THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
[2022-03-09T08:28:51.252Z] # AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
[2022-03-09T08:28:51.252Z] # IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
[2022-03-09T08:28:51.252Z] # ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
[2022-03-09T08:28:51.252Z] # LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
[2022-03-09T08:28:51.252Z] # CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
[2022-03-09T08:28:51.252Z] # SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
[2022-03-09T08:28:51.252Z] # INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
[2022-03-09T08:28:51.252Z] # CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
[2022-03-09T08:28:51.252Z] # ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
[2022-03-09T08:28:51.252Z] # POSSIBILITY OF SUCH DAMAGE.
[2022-03-09T08:28:51.252Z] #******************************************************************************
[2022-03-09T08:28:51.252Z]
[2022-03-09T08:28:51.252Z] """
[2022-03-09T08:28:51.252Z] Direct wrappers for Fortran `id_dist` backend.
[2022-03-09T08:28:51.252Z] """
[2022-03-09T08:28:51.252Z]
[2022-03-09T08:28:51.252Z] > import scipy.linalg._interpolative as _id
[2022-03-09T08:28:51.252Z] E ImportError: /usr/lib/python3.10/site-packages/scipy/linalg/_interpolative.cpython-310-x86_64-linux-gnu.so: undefined symbol: _ZGVbN2v_sin
[2022-03-09T08:28:51.252Z]
[2022-03-09T08:28:51.252Z] /usr/lib/python3.10/site-packages/scipy/linalg/_interpolative_backend.py:34: ImportError
[2022-03-09T08:28:51.252Z] _______________________ TestSimilarity.testOneExtraEdge ________________________
[2022-03-09T08:28:51.252Z]
[2022-03-09T08:28:51.252Z] self = <networkx.algorithms.tests.test_similarity.TestSimilarity object at 0x7fe884db2920>
[2022-03-09T08:28:51.252Z]
[2022-03-09T08:28:51.252Z] def testOneExtraEdge(self):
[2022-03-09T08:28:51.252Z] G1 = nx.Graph()
[2022-03-09T08:28:51.252Z] G1.add_node("A", label="A")
[2022-03-09T08:28:51.252Z] G1.add_node("B", label="B")
[2022-03-09T08:28:51.252Z] G1.add_node("C", label="C")
[2022-03-09T08:28:51.252Z] G1.add_node("C", label="C")
[2022-03-09T08:28:51.252Z] G1.add_edge("A", "B", label="a-b")
[2022-03-09T08:28:51.252Z] G2 = nx.Graph()
[2022-03-09T08:28:51.252Z] G2.add_node("A", label="A")
[2022-03-09T08:28:51.252Z] G2.add_node("B", label="B")
[2022-03-09T08:28:51.252Z] G2.add_node("C", label="C")
[2022-03-09T08:28:51.252Z] G2.add_edge("A", "B", label="a-b")
[2022-03-09T08:28:51.252Z] G2.add_edge("A", "C", label="a-c")
[2022-03-09T08:28:51.252Z] > assert graph_edit_distance(G1, G2, node_match=nmatch, edge_match=ematch) == 1
[2022-03-09T08:28:51.252Z]
[2022-03-09T08:28:51.252Z] networkx/algorithms/tests/test_similarity.py:430:
[2022-03-09T08:28:51.252Z] _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
[2022-03-09T08:28:51.252Z] networkx/algorithms/similarity.py:190: in graph_edit_distance
[2022-03-09T08:28:51.252Z] for vertex_path, edge_path, cost in optimize_edit_paths(
[2022-03-09T08:28:51.252Z] networkx/algorithms/similarity.py:673: in optimize_edit_paths
[2022-03-09T08:28:51.252Z] import scipy.optimize # call as sp.optimize
[2022-03-09T08:28:51.252Z] /usr/lib/python3.10/site-packages/scipy/optimize/__init__.py:412: in <module>
[2022-03-09T08:28:51.252Z] from ._linprog import linprog, linprog_verbose_callback
[2022-03-09T08:28:51.252Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog.py:23: in <module>
[2022-03-09T08:28:51.252Z] from ._linprog_ip import _linprog_ip
[2022-03-09T08:28:51.252Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog_ip.py:27: in <module>
[2022-03-09T08:28:51.252Z] from ._linprog_util import _postsolve
[2022-03-09T08:28:51.252Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog_util.py:9: in <module>
[2022-03-09T08:28:51.252Z] from scipy.optimize._remove_redundancy import (
[2022-03-09T08:28:51.252Z] /usr/lib/python3.10/site-packages/scipy/optimize/_remove_redundancy.py:9: in <module>
[2022-03-09T08:28:51.252Z] from scipy.linalg.interpolative import interp_decomp
[2022-03-09T08:28:51.252Z] /usr/lib/python3.10/site-packages/scipy/linalg/interpolative.py:385: in <module>
[2022-03-09T08:28:51.252Z] import scipy.linalg._interpolative_backend as _backend
[2022-03-09T08:28:51.252Z] _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
[2022-03-09T08:28:51.252Z]
[2022-03-09T08:28:51.252Z] #******************************************************************************
[2022-03-09T08:28:51.252Z] # Copyright (C) 2013 Kenneth L. Ho
[2022-03-09T08:28:51.252Z] #
[2022-03-09T08:28:51.252Z] # Redistribution and use in source and binary forms, with or without
[2022-03-09T08:28:51.252Z] # modification, are permitted provided that the following conditions are met:
[2022-03-09T08:28:51.252Z] #
[2022-03-09T08:28:51.252Z] # Redistributions of source code must retain the above copyright notice, this
[2022-03-09T08:28:51.252Z] # list of conditions and the following disclaimer. Redistributions in binary
[2022-03-09T08:28:51.252Z] # form must reproduce the above copyright notice, this list of conditions and
[2022-03-09T08:28:51.252Z] # the following disclaimer in the documentation and/or other materials
[2022-03-09T08:28:51.252Z] # provided with the distribution.
[2022-03-09T08:28:51.252Z] #
[2022-03-09T08:28:51.253Z] # None of the names of the copyright holders may be used to endorse or
[2022-03-09T08:28:51.253Z] # promote products derived from this software without specific prior written
[2022-03-09T08:28:51.253Z] # permission.
[2022-03-09T08:28:51.253Z] #
[2022-03-09T08:28:51.253Z] # THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
[2022-03-09T08:28:51.253Z] # AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
[2022-03-09T08:28:51.253Z] # IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
[2022-03-09T08:28:51.253Z] # ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
[2022-03-09T08:28:51.253Z] # LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
[2022-03-09T08:28:51.253Z] # CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
[2022-03-09T08:28:51.253Z] # SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
[2022-03-09T08:28:51.253Z] # INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
[2022-03-09T08:28:51.253Z] # CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
[2022-03-09T08:28:51.253Z] # ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
[2022-03-09T08:28:51.253Z] # POSSIBILITY OF SUCH DAMAGE.
[2022-03-09T08:28:51.253Z] #******************************************************************************
[2022-03-09T08:28:51.253Z]
[2022-03-09T08:28:51.253Z] """
[2022-03-09T08:28:51.253Z] Direct wrappers for Fortran `id_dist` backend.
[2022-03-09T08:28:51.253Z] """
[2022-03-09T08:28:51.253Z]
[2022-03-09T08:28:51.253Z] > import scipy.linalg._interpolative as _id
[2022-03-09T08:28:51.253Z] E ImportError: /usr/lib/python3.10/site-packages/scipy/linalg/_interpolative.cpython-310-x86_64-linux-gnu.so: undefined symbol: _ZGVbN2v_sin
[2022-03-09T08:28:51.253Z]
[2022-03-09T08:28:51.253Z] /usr/lib/python3.10/site-packages/scipy/linalg/_interpolative_backend.py:34: ImportError
[2022-03-09T08:28:51.253Z] ____________________ TestSimilarity.testOneExtraNodeAndEdge ____________________
[2022-03-09T08:28:51.253Z]
[2022-03-09T08:28:51.253Z] self = <networkx.algorithms.tests.test_similarity.TestSimilarity object at 0x7fe884db1570>
[2022-03-09T08:28:51.253Z]
[2022-03-09T08:28:51.253Z] def testOneExtraNodeAndEdge(self):
[2022-03-09T08:28:51.253Z] G1 = nx.Graph()
[2022-03-09T08:28:51.253Z] G1.add_node("A", label="A")
[2022-03-09T08:28:51.253Z] G1.add_node("B", label="B")
[2022-03-09T08:28:51.253Z] G1.add_edge("A", "B", label="a-b")
[2022-03-09T08:28:51.253Z] G2 = nx.Graph()
[2022-03-09T08:28:51.253Z] G2.add_node("A", label="A")
[2022-03-09T08:28:51.253Z] G2.add_node("B", label="B")
[2022-03-09T08:28:51.253Z] G2.add_node("C", label="C")
[2022-03-09T08:28:51.253Z] G2.add_edge("A", "B", label="a-b")
[2022-03-09T08:28:51.253Z] G2.add_edge("A", "C", label="a-c")
[2022-03-09T08:28:51.253Z] > assert graph_edit_distance(G1, G2, node_match=nmatch, edge_match=ematch) == 2
[2022-03-09T08:28:51.253Z]
[2022-03-09T08:28:51.253Z] networkx/algorithms/tests/test_similarity.py:443:
[2022-03-09T08:28:51.253Z] _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
[2022-03-09T08:28:51.253Z] networkx/algorithms/similarity.py:190: in graph_edit_distance
[2022-03-09T08:28:51.253Z] for vertex_path, edge_path, cost in optimize_edit_paths(
[2022-03-09T08:28:51.253Z] networkx/algorithms/similarity.py:673: in optimize_edit_paths
[2022-03-09T08:28:51.253Z] import scipy.optimize # call as sp.optimize
[2022-03-09T08:28:51.253Z] /usr/lib/python3.10/site-packages/scipy/optimize/__init__.py:412: in <module>
[2022-03-09T08:28:51.253Z] from ._linprog import linprog, linprog_verbose_callback
[2022-03-09T08:28:51.253Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog.py:23: in <module>
[2022-03-09T08:28:51.253Z] from ._linprog_ip import _linprog_ip
[2022-03-09T08:28:51.253Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog_ip.py:27: in <module>
[2022-03-09T08:28:51.253Z] from ._linprog_util import _postsolve
[2022-03-09T08:28:51.253Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog_util.py:9: in <module>
[2022-03-09T08:28:51.253Z] from scipy.optimize._remove_redundancy import (
[2022-03-09T08:28:51.253Z] /usr/lib/python3.10/site-packages/scipy/optimize/_remove_redundancy.py:9: in <module>
[2022-03-09T08:28:51.253Z] from scipy.linalg.interpolative import interp_decomp
[2022-03-09T08:28:51.253Z] /usr/lib/python3.10/site-packages/scipy/linalg/interpolative.py:385: in <module>
[2022-03-09T08:28:51.253Z] import scipy.linalg._interpolative_backend as _backend
[2022-03-09T08:28:51.253Z] _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
[2022-03-09T08:28:51.253Z]
[2022-03-09T08:28:51.253Z] #******************************************************************************
[2022-03-09T08:28:51.253Z] # Copyright (C) 2013 Kenneth L. Ho
[2022-03-09T08:28:51.253Z] #
[2022-03-09T08:28:51.253Z] # Redistribution and use in source and binary forms, with or without
[2022-03-09T08:28:51.253Z] # modification, are permitted provided that the following conditions are met:
[2022-03-09T08:28:51.253Z] #
[2022-03-09T08:28:51.253Z] # Redistributions of source code must retain the above copyright notice, this
[2022-03-09T08:28:51.253Z] # list of conditions and the following disclaimer. Redistributions in binary
[2022-03-09T08:28:51.253Z] # form must reproduce the above copyright notice, this list of conditions and
[2022-03-09T08:28:51.253Z] # the following disclaimer in the documentation and/or other materials
[2022-03-09T08:28:51.253Z] # provided with the distribution.
[2022-03-09T08:28:51.253Z] #
[2022-03-09T08:28:51.253Z] # None of the names of the copyright holders may be used to endorse or
[2022-03-09T08:28:51.253Z] # promote products derived from this software without specific prior written
[2022-03-09T08:28:51.253Z] # permission.
[2022-03-09T08:28:51.253Z] #
[2022-03-09T08:28:51.253Z] # THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
[2022-03-09T08:28:51.253Z] # AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
[2022-03-09T08:28:51.253Z] # IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
[2022-03-09T08:28:51.254Z] # ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
[2022-03-09T08:28:51.254Z] # LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
[2022-03-09T08:28:51.254Z] # CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
[2022-03-09T08:28:51.254Z] # SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
[2022-03-09T08:28:51.254Z] # INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
[2022-03-09T08:28:51.254Z] # CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
[2022-03-09T08:28:51.254Z] # ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
[2022-03-09T08:28:51.254Z] # POSSIBILITY OF SUCH DAMAGE.
[2022-03-09T08:28:51.254Z] #******************************************************************************
[2022-03-09T08:28:51.254Z]
[2022-03-09T08:28:51.254Z] """
[2022-03-09T08:28:51.254Z] Direct wrappers for Fortran `id_dist` backend.
[2022-03-09T08:28:51.254Z] """
[2022-03-09T08:28:51.254Z]
[2022-03-09T08:28:51.254Z] > import scipy.linalg._interpolative as _id
[2022-03-09T08:28:51.254Z] E ImportError: /usr/lib/python3.10/site-packages/scipy/linalg/_interpolative.cpython-310-x86_64-linux-gnu.so: undefined symbol: _ZGVbN2v_sin
[2022-03-09T08:28:51.254Z]
[2022-03-09T08:28:51.254Z] /usr/lib/python3.10/site-packages/scipy/linalg/_interpolative_backend.py:34: ImportError
[2022-03-09T08:28:51.254Z] __________________________ TestSimilarity.testGraph1 ___________________________
[2022-03-09T08:28:51.254Z]
[2022-03-09T08:28:51.254Z] self = <networkx.algorithms.tests.test_similarity.TestSimilarity object at 0x7fe884db2410>
[2022-03-09T08:28:51.254Z]
[2022-03-09T08:28:51.254Z] def testGraph1(self):
[2022-03-09T08:28:51.254Z] G1 = getCanonical()
[2022-03-09T08:28:51.254Z] G2 = nx.Graph()
[2022-03-09T08:28:51.254Z] G2.add_node("A", label="A")
[2022-03-09T08:28:51.254Z] G2.add_node("B", label="B")
[2022-03-09T08:28:51.254Z] G2.add_node("D", label="D")
[2022-03-09T08:28:51.254Z] G2.add_node("E", label="E")
[2022-03-09T08:28:51.254Z] G2.add_edge("A", "B", label="a-b")
[2022-03-09T08:28:51.254Z] G2.add_edge("B", "D", label="b-d")
[2022-03-09T08:28:51.254Z] G2.add_edge("D", "E", label="d-e")
[2022-03-09T08:28:51.254Z] > assert graph_edit_distance(G1, G2, node_match=nmatch, edge_match=ematch) == 3
[2022-03-09T08:28:51.254Z]
[2022-03-09T08:28:51.254Z] networkx/algorithms/tests/test_similarity.py:455:
[2022-03-09T08:28:51.254Z] _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
[2022-03-09T08:28:51.254Z] networkx/algorithms/similarity.py:190: in graph_edit_distance
[2022-03-09T08:28:51.254Z] for vertex_path, edge_path, cost in optimize_edit_paths(
[2022-03-09T08:28:51.254Z] networkx/algorithms/similarity.py:673: in optimize_edit_paths
[2022-03-09T08:28:51.254Z] import scipy.optimize # call as sp.optimize
[2022-03-09T08:28:51.254Z] /usr/lib/python3.10/site-packages/scipy/optimize/__init__.py:412: in <module>
[2022-03-09T08:28:51.254Z] from ._linprog import linprog, linprog_verbose_callback
[2022-03-09T08:28:51.254Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog.py:23: in <module>
[2022-03-09T08:28:51.254Z] from ._linprog_ip import _linprog_ip
[2022-03-09T08:28:51.254Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog_ip.py:27: in <module>
[2022-03-09T08:28:51.254Z] from ._linprog_util import _postsolve
[2022-03-09T08:28:51.254Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog_util.py:9: in <module>
[2022-03-09T08:28:51.254Z] from scipy.optimize._remove_redundancy import (
[2022-03-09T08:28:51.254Z] /usr/lib/python3.10/site-packages/scipy/optimize/_remove_redundancy.py:9: in <module>
[2022-03-09T08:28:51.254Z] from scipy.linalg.interpolative import interp_decomp
[2022-03-09T08:28:51.254Z] /usr/lib/python3.10/site-packages/scipy/linalg/interpolative.py:385: in <module>
[2022-03-09T08:28:51.254Z] import scipy.linalg._interpolative_backend as _backend
[2022-03-09T08:28:51.254Z] _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
[2022-03-09T08:28:51.254Z]
[2022-03-09T08:28:51.254Z] #******************************************************************************
[2022-03-09T08:28:51.254Z] # Copyright (C) 2013 Kenneth L. Ho
[2022-03-09T08:28:51.254Z] #
[2022-03-09T08:28:51.254Z] # Redistribution and use in source and binary forms, with or without
[2022-03-09T08:28:51.254Z] # modification, are permitted provided that the following conditions are met:
[2022-03-09T08:28:51.254Z] #
[2022-03-09T08:28:51.254Z] # Redistributions of source code must retain the above copyright notice, this
[2022-03-09T08:28:51.254Z] # list of conditions and the following disclaimer. Redistributions in binary
[2022-03-09T08:28:51.254Z] # form must reproduce the above copyright notice, this list of conditions and
[2022-03-09T08:28:51.254Z] # the following disclaimer in the documentation and/or other materials
[2022-03-09T08:28:51.254Z] # provided with the distribution.
[2022-03-09T08:28:51.254Z] #
[2022-03-09T08:28:51.254Z] # None of the names of the copyright holders may be used to endorse or
[2022-03-09T08:28:51.254Z] # promote products derived from this software without specific prior written
[2022-03-09T08:28:51.254Z] # permission.
[2022-03-09T08:28:51.254Z] #
[2022-03-09T08:28:51.254Z] # THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
[2022-03-09T08:28:51.254Z] # AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
[2022-03-09T08:28:51.254Z] # IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
[2022-03-09T08:28:51.254Z] # ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
[2022-03-09T08:28:51.254Z] # LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
[2022-03-09T08:28:51.254Z] # CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
[2022-03-09T08:28:51.254Z] # SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
[2022-03-09T08:28:51.254Z] # INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
[2022-03-09T08:28:51.254Z] # CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
[2022-03-09T08:28:51.255Z] # ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
[2022-03-09T08:28:51.255Z] # POSSIBILITY OF SUCH DAMAGE.
[2022-03-09T08:28:51.255Z] #******************************************************************************
[2022-03-09T08:28:51.255Z]
[2022-03-09T08:28:51.255Z] """
[2022-03-09T08:28:51.255Z] Direct wrappers for Fortran `id_dist` backend.
[2022-03-09T08:28:51.255Z] """
[2022-03-09T08:28:51.255Z]
[2022-03-09T08:28:51.255Z] > import scipy.linalg._interpolative as _id
[2022-03-09T08:28:51.255Z] E ImportError: /usr/lib/python3.10/site-packages/scipy/linalg/_interpolative.cpython-310-x86_64-linux-gnu.so: undefined symbol: _ZGVbN2v_sin
[2022-03-09T08:28:51.255Z]
[2022-03-09T08:28:51.255Z] /usr/lib/python3.10/site-packages/scipy/linalg/_interpolative_backend.py:34: ImportError
[2022-03-09T08:28:51.255Z] __________________________ TestSimilarity.testGraph2 ___________________________
[2022-03-09T08:28:51.255Z]
[2022-03-09T08:28:51.255Z] self = <networkx.algorithms.tests.test_similarity.TestSimilarity object at 0x7fe884db0940>
[2022-03-09T08:28:51.255Z]
[2022-03-09T08:28:51.255Z] def testGraph2(self):
[2022-03-09T08:28:51.255Z] G1 = getCanonical()
[2022-03-09T08:28:51.255Z] G2 = nx.Graph()
[2022-03-09T08:28:51.255Z] G2.add_node("A", label="A")
[2022-03-09T08:28:51.255Z] G2.add_node("B", label="B")
[2022-03-09T08:28:51.255Z] G2.add_node("C", label="C")
[2022-03-09T08:28:51.255Z] G2.add_node("D", label="D")
[2022-03-09T08:28:51.255Z] G2.add_node("E", label="E")
[2022-03-09T08:28:51.255Z] G2.add_edge("A", "B", label="a-b")
[2022-03-09T08:28:51.255Z] G2.add_edge("B", "C", label="b-c")
[2022-03-09T08:28:51.255Z] G2.add_edge("C", "D", label="c-d")
[2022-03-09T08:28:51.255Z] G2.add_edge("C", "E", label="c-e")
[2022-03-09T08:28:51.255Z] > assert graph_edit_distance(G1, G2, node_match=nmatch, edge_match=ematch) == 4
[2022-03-09T08:28:51.255Z]
[2022-03-09T08:28:51.255Z] networkx/algorithms/tests/test_similarity.py:469:
[2022-03-09T08:28:51.255Z] _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
[2022-03-09T08:28:51.255Z] networkx/algorithms/similarity.py:190: in graph_edit_distance
[2022-03-09T08:28:51.255Z] for vertex_path, edge_path, cost in optimize_edit_paths(
[2022-03-09T08:28:51.255Z] networkx/algorithms/similarity.py:673: in optimize_edit_paths
[2022-03-09T08:28:51.255Z] import scipy.optimize # call as sp.optimize
[2022-03-09T08:28:51.255Z] /usr/lib/python3.10/site-packages/scipy/optimize/__init__.py:412: in <module>
[2022-03-09T08:28:51.255Z] from ._linprog import linprog, linprog_verbose_callback
[2022-03-09T08:28:51.255Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog.py:23: in <module>
[2022-03-09T08:28:51.255Z] from ._linprog_ip import _linprog_ip
[2022-03-09T08:28:51.255Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog_ip.py:27: in <module>
[2022-03-09T08:28:51.255Z] from ._linprog_util import _postsolve
[2022-03-09T08:28:51.255Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog_util.py:9: in <module>
[2022-03-09T08:28:51.255Z] from scipy.optimize._remove_redundancy import (
[2022-03-09T08:28:51.255Z] /usr/lib/python3.10/site-packages/scipy/optimize/_remove_redundancy.py:9: in <module>
[2022-03-09T08:28:51.255Z] from scipy.linalg.interpolative import interp_decomp
[2022-03-09T08:28:51.255Z] /usr/lib/python3.10/site-packages/scipy/linalg/interpolative.py:385: in <module>
[2022-03-09T08:28:51.255Z] import scipy.linalg._interpolative_backend as _backend
[2022-03-09T08:28:51.255Z] _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
[2022-03-09T08:28:51.255Z]
[2022-03-09T08:28:51.255Z] #******************************************************************************
[2022-03-09T08:28:51.255Z] # Copyright (C) 2013 Kenneth L. Ho
[2022-03-09T08:28:51.255Z] #
[2022-03-09T08:28:51.255Z] # Redistribution and use in source and binary forms, with or without
[2022-03-09T08:28:51.255Z] # modification, are permitted provided that the following conditions are met:
[2022-03-09T08:28:51.255Z] #
[2022-03-09T08:28:51.255Z] # Redistributions of source code must retain the above copyright notice, this
[2022-03-09T08:28:51.255Z] # list of conditions and the following disclaimer. Redistributions in binary
[2022-03-09T08:28:51.255Z] # form must reproduce the above copyright notice, this list of conditions and
[2022-03-09T08:28:51.255Z] # the following disclaimer in the documentation and/or other materials
[2022-03-09T08:28:51.255Z] # provided with the distribution.
[2022-03-09T08:28:51.255Z] #
[2022-03-09T08:28:51.255Z] # None of the names of the copyright holders may be used to endorse or
[2022-03-09T08:28:51.255Z] # promote products derived from this software without specific prior written
[2022-03-09T08:28:51.255Z] # permission.
[2022-03-09T08:28:51.255Z] #
[2022-03-09T08:28:51.255Z] # THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
[2022-03-09T08:28:51.255Z] # AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
[2022-03-09T08:28:51.255Z] # IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
[2022-03-09T08:28:51.255Z] # ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
[2022-03-09T08:28:51.255Z] # LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
[2022-03-09T08:28:51.255Z] # CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
[2022-03-09T08:28:51.255Z] # SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
[2022-03-09T08:28:51.255Z] # INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
[2022-03-09T08:28:51.255Z] # CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
[2022-03-09T08:28:51.255Z] # ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
[2022-03-09T08:28:51.255Z] # POSSIBILITY OF SUCH DAMAGE.
[2022-03-09T08:28:51.255Z] #******************************************************************************
[2022-03-09T08:28:51.255Z]
[2022-03-09T08:28:51.255Z] """
[2022-03-09T08:28:51.255Z] Direct wrappers for Fortran `id_dist` backend.
[2022-03-09T08:28:51.255Z] """
[2022-03-09T08:28:51.255Z]
[2022-03-09T08:28:51.255Z] > import scipy.linalg._interpolative as _id
[2022-03-09T08:28:51.256Z] E ImportError: /usr/lib/python3.10/site-packages/scipy/linalg/_interpolative.cpython-310-x86_64-linux-gnu.so: undefined symbol: _ZGVbN2v_sin
[2022-03-09T08:28:51.256Z]
[2022-03-09T08:28:51.256Z] /usr/lib/python3.10/site-packages/scipy/linalg/_interpolative_backend.py:34: ImportError
[2022-03-09T08:28:51.256Z] __________________________ TestSimilarity.testGraph3 ___________________________
[2022-03-09T08:28:51.256Z]
[2022-03-09T08:28:51.256Z] self = <networkx.algorithms.tests.test_similarity.TestSimilarity object at 0x7fe884db26b0>
[2022-03-09T08:28:51.256Z]
[2022-03-09T08:28:51.256Z] def testGraph3(self):
[2022-03-09T08:28:51.256Z] G1 = getCanonical()
[2022-03-09T08:28:51.256Z] G2 = nx.Graph()
[2022-03-09T08:28:51.256Z] G2.add_node("A", label="A")
[2022-03-09T08:28:51.256Z] G2.add_node("B", label="B")
[2022-03-09T08:28:51.256Z] G2.add_node("C", label="C")
[2022-03-09T08:28:51.256Z] G2.add_node("D", label="D")
[2022-03-09T08:28:51.256Z] G2.add_node("E", label="E")
[2022-03-09T08:28:51.256Z] G2.add_node("F", label="F")
[2022-03-09T08:28:51.256Z] G2.add_node("G", label="G")
[2022-03-09T08:28:51.256Z] G2.add_edge("A", "C", label="a-c")
[2022-03-09T08:28:51.256Z] G2.add_edge("A", "D", label="a-d")
[2022-03-09T08:28:51.256Z] G2.add_edge("D", "E", label="d-e")
[2022-03-09T08:28:51.256Z] G2.add_edge("D", "F", label="d-f")
[2022-03-09T08:28:51.256Z] G2.add_edge("D", "G", label="d-g")
[2022-03-09T08:28:51.256Z] G2.add_edge("E", "B", label="e-b")
[2022-03-09T08:28:51.256Z] > assert graph_edit_distance(G1, G2, node_match=nmatch, edge_match=ematch) == 12
[2022-03-09T08:28:51.256Z]
[2022-03-09T08:28:51.256Z] networkx/algorithms/tests/test_similarity.py:487:
[2022-03-09T08:28:51.256Z] _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
[2022-03-09T08:28:51.256Z] networkx/algorithms/similarity.py:190: in graph_edit_distance
[2022-03-09T08:28:51.256Z] for vertex_path, edge_path, cost in optimize_edit_paths(
[2022-03-09T08:28:51.256Z] networkx/algorithms/similarity.py:673: in optimize_edit_paths
[2022-03-09T08:28:51.256Z] import scipy.optimize # call as sp.optimize
[2022-03-09T08:28:51.256Z] /usr/lib/python3.10/site-packages/scipy/optimize/__init__.py:412: in <module>
[2022-03-09T08:28:51.256Z] from ._linprog import linprog, linprog_verbose_callback
[2022-03-09T08:28:51.256Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog.py:23: in <module>
[2022-03-09T08:28:51.256Z] from ._linprog_ip import _linprog_ip
[2022-03-09T08:28:51.256Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog_ip.py:27: in <module>
[2022-03-09T08:28:51.256Z] from ._linprog_util import _postsolve
[2022-03-09T08:28:51.256Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog_util.py:9: in <module>
[2022-03-09T08:28:51.256Z] from scipy.optimize._remove_redundancy import (
[2022-03-09T08:28:51.256Z] /usr/lib/python3.10/site-packages/scipy/optimize/_remove_redundancy.py:9: in <module>
[2022-03-09T08:28:51.256Z] from scipy.linalg.interpolative import interp_decomp
[2022-03-09T08:28:51.256Z] /usr/lib/python3.10/site-packages/scipy/linalg/interpolative.py:385: in <module>
[2022-03-09T08:28:51.256Z] import scipy.linalg._interpolative_backend as _backend
[2022-03-09T08:28:51.256Z] _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
[2022-03-09T08:28:51.256Z]
[2022-03-09T08:28:51.256Z] #******************************************************************************
[2022-03-09T08:28:51.256Z] # Copyright (C) 2013 Kenneth L. Ho
[2022-03-09T08:28:51.256Z] #
[2022-03-09T08:28:51.256Z] # Redistribution and use in source and binary forms, with or without
[2022-03-09T08:28:51.256Z] # modification, are permitted provided that the following conditions are met:
[2022-03-09T08:28:51.256Z] #
[2022-03-09T08:28:51.256Z] # Redistributions of source code must retain the above copyright notice, this
[2022-03-09T08:28:51.256Z] # list of conditions and the following disclaimer. Redistributions in binary
[2022-03-09T08:28:51.256Z] # form must reproduce the above copyright notice, this list of conditions and
[2022-03-09T08:28:51.256Z] # the following disclaimer in the documentation and/or other materials
[2022-03-09T08:28:51.256Z] # provided with the distribution.
[2022-03-09T08:28:51.256Z] #
[2022-03-09T08:28:51.256Z] # None of the names of the copyright holders may be used to endorse or
[2022-03-09T08:28:51.256Z] # promote products derived from this software without specific prior written
[2022-03-09T08:28:51.256Z] # permission.
[2022-03-09T08:28:51.256Z] #
[2022-03-09T08:28:51.256Z] # THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
[2022-03-09T08:28:51.256Z] # AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
[2022-03-09T08:28:51.256Z] # IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
[2022-03-09T08:28:51.256Z] # ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
[2022-03-09T08:28:51.256Z] # LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
[2022-03-09T08:28:51.256Z] # CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
[2022-03-09T08:28:51.256Z] # SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
[2022-03-09T08:28:51.256Z] # INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
[2022-03-09T08:28:51.256Z] # CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
[2022-03-09T08:28:51.256Z] # ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
[2022-03-09T08:28:51.256Z] # POSSIBILITY OF SUCH DAMAGE.
[2022-03-09T08:28:51.256Z] #******************************************************************************
[2022-03-09T08:28:51.256Z]
[2022-03-09T08:28:51.256Z] """
[2022-03-09T08:28:51.256Z] Direct wrappers for Fortran `id_dist` backend.
[2022-03-09T08:28:51.256Z] """
[2022-03-09T08:28:51.256Z]
[2022-03-09T08:28:51.256Z] > import scipy.linalg._interpolative as _id
[2022-03-09T08:28:51.256Z] E ImportError: /usr/lib/python3.10/site-packages/scipy/linalg/_interpolative.cpython-310-x86_64-linux-gnu.so: undefined symbol: _ZGVbN2v_sin
[2022-03-09T08:28:51.256Z]
[2022-03-09T08:28:51.256Z] /usr/lib/python3.10/site-packages/scipy/linalg/_interpolative_backend.py:34: ImportError
[2022-03-09T08:28:51.257Z] __________________________ TestSimilarity.testGraph4 ___________________________
[2022-03-09T08:28:51.257Z]
[2022-03-09T08:28:51.257Z] self = <networkx.algorithms.tests.test_similarity.TestSimilarity object at 0x7fe884db27d0>
[2022-03-09T08:28:51.257Z]
[2022-03-09T08:28:51.257Z] def testGraph4(self):
[2022-03-09T08:28:51.257Z] G1 = getCanonical()
[2022-03-09T08:28:51.257Z] G2 = nx.Graph()
[2022-03-09T08:28:51.257Z] G2.add_node("A", label="A")
[2022-03-09T08:28:51.257Z] G2.add_node("B", label="B")
[2022-03-09T08:28:51.257Z] G2.add_node("C", label="C")
[2022-03-09T08:28:51.257Z] G2.add_node("D", label="D")
[2022-03-09T08:28:51.257Z] G2.add_edge("A", "B", label="a-b")
[2022-03-09T08:28:51.257Z] G2.add_edge("B", "C", label="b-c")
[2022-03-09T08:28:51.257Z] G2.add_edge("C", "D", label="c-d")
[2022-03-09T08:28:51.257Z] > assert graph_edit_distance(G1, G2, node_match=nmatch, edge_match=ematch) == 2
[2022-03-09T08:28:51.257Z]
[2022-03-09T08:28:51.257Z] networkx/algorithms/tests/test_similarity.py:499:
[2022-03-09T08:28:51.257Z] _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
[2022-03-09T08:28:51.257Z] networkx/algorithms/similarity.py:190: in graph_edit_distance
[2022-03-09T08:28:51.257Z] for vertex_path, edge_path, cost in optimize_edit_paths(
[2022-03-09T08:28:51.257Z] networkx/algorithms/similarity.py:673: in optimize_edit_paths
[2022-03-09T08:28:51.257Z] import scipy.optimize # call as sp.optimize
[2022-03-09T08:28:51.257Z] /usr/lib/python3.10/site-packages/scipy/optimize/__init__.py:412: in <module>
[2022-03-09T08:28:51.257Z] from ._linprog import linprog, linprog_verbose_callback
[2022-03-09T08:28:51.257Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog.py:23: in <module>
[2022-03-09T08:28:51.257Z] from ._linprog_ip import _linprog_ip
[2022-03-09T08:28:51.257Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog_ip.py:27: in <module>
[2022-03-09T08:28:51.257Z] from ._linprog_util import _postsolve
[2022-03-09T08:28:51.257Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog_util.py:9: in <module>
[2022-03-09T08:28:51.257Z] from scipy.optimize._remove_redundancy import (
[2022-03-09T08:28:51.257Z] /usr/lib/python3.10/site-packages/scipy/optimize/_remove_redundancy.py:9: in <module>
[2022-03-09T08:28:51.257Z] from scipy.linalg.interpolative import interp_decomp
[2022-03-09T08:28:51.257Z] /usr/lib/python3.10/site-packages/scipy/linalg/interpolative.py:385: in <module>
[2022-03-09T08:28:51.257Z] import scipy.linalg._interpolative_backend as _backend
[2022-03-09T08:28:51.257Z] _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
[2022-03-09T08:28:51.257Z]
[2022-03-09T08:28:51.257Z] #******************************************************************************
[2022-03-09T08:28:51.257Z] # Copyright (C) 2013 Kenneth L. Ho
[2022-03-09T08:28:51.257Z] #
[2022-03-09T08:28:51.257Z] # Redistribution and use in source and binary forms, with or without
[2022-03-09T08:28:51.257Z] # modification, are permitted provided that the following conditions are met:
[2022-03-09T08:28:51.257Z] #
[2022-03-09T08:28:51.257Z] # Redistributions of source code must retain the above copyright notice, this
[2022-03-09T08:28:51.257Z] # list of conditions and the following disclaimer. Redistributions in binary
[2022-03-09T08:28:51.257Z] # form must reproduce the above copyright notice, this list of conditions and
[2022-03-09T08:28:51.257Z] # the following disclaimer in the documentation and/or other materials
[2022-03-09T08:28:51.257Z] # provided with the distribution.
[2022-03-09T08:28:51.257Z] #
[2022-03-09T08:28:51.257Z] # None of the names of the copyright holders may be used to endorse or
[2022-03-09T08:28:51.257Z] # promote products derived from this software without specific prior written
[2022-03-09T08:28:51.257Z] # permission.
[2022-03-09T08:28:51.257Z] #
[2022-03-09T08:28:51.257Z] # THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
[2022-03-09T08:28:51.257Z] # AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
[2022-03-09T08:28:51.257Z] # IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
[2022-03-09T08:28:51.257Z] # ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
[2022-03-09T08:28:51.257Z] # LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
[2022-03-09T08:28:51.257Z] # CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
[2022-03-09T08:28:51.257Z] # SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
[2022-03-09T08:28:51.257Z] # INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
[2022-03-09T08:28:51.257Z] # CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
[2022-03-09T08:28:51.257Z] # ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
[2022-03-09T08:28:51.257Z] # POSSIBILITY OF SUCH DAMAGE.
[2022-03-09T08:28:51.257Z] #******************************************************************************
[2022-03-09T08:28:51.257Z]
[2022-03-09T08:28:51.257Z] """
[2022-03-09T08:28:51.257Z] Direct wrappers for Fortran `id_dist` backend.
[2022-03-09T08:28:51.257Z] """
[2022-03-09T08:28:51.257Z]
[2022-03-09T08:28:51.257Z] > import scipy.linalg._interpolative as _id
[2022-03-09T08:28:51.257Z] E ImportError: /usr/lib/python3.10/site-packages/scipy/linalg/_interpolative.cpython-310-x86_64-linux-gnu.so: undefined symbol: _ZGVbN2v_sin
[2022-03-09T08:28:51.257Z]
[2022-03-09T08:28:51.257Z] /usr/lib/python3.10/site-packages/scipy/linalg/_interpolative_backend.py:34: ImportError
[2022-03-09T08:28:51.257Z] _________________________ TestSimilarity.testGraph4_a __________________________
[2022-03-09T08:28:51.257Z]
[2022-03-09T08:28:51.257Z] self = <networkx.algorithms.tests.test_similarity.TestSimilarity object at 0x7fe884db2c80>
[2022-03-09T08:28:51.257Z]
[2022-03-09T08:28:51.257Z] def testGraph4_a(self):
[2022-03-09T08:28:51.257Z] G1 = getCanonical()
[2022-03-09T08:28:51.257Z] G2 = nx.Graph()
[2022-03-09T08:28:51.257Z] G2.add_node("A", label="A")
[2022-03-09T08:28:51.257Z] G2.add_node("B", label="B")
[2022-03-09T08:28:51.257Z] G2.add_node("C", label="C")
[2022-03-09T08:28:51.257Z] G2.add_node("D", label="D")
[2022-03-09T08:28:51.257Z] G2.add_edge("A", "B", label="a-b")
[2022-03-09T08:28:51.257Z] G2.add_edge("B", "C", label="b-c")
[2022-03-09T08:28:51.258Z] G2.add_edge("A", "D", label="a-d")
[2022-03-09T08:28:51.258Z] > assert graph_edit_distance(G1, G2, node_match=nmatch, edge_match=ematch) == 2
[2022-03-09T08:28:51.258Z]
[2022-03-09T08:28:51.258Z] networkx/algorithms/tests/test_similarity.py:511:
[2022-03-09T08:28:51.258Z] _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
[2022-03-09T08:28:51.258Z] networkx/algorithms/similarity.py:190: in graph_edit_distance
[2022-03-09T08:28:51.258Z] for vertex_path, edge_path, cost in optimize_edit_paths(
[2022-03-09T08:28:51.258Z] networkx/algorithms/similarity.py:673: in optimize_edit_paths
[2022-03-09T08:28:51.258Z] import scipy.optimize # call as sp.optimize
[2022-03-09T08:28:51.258Z] /usr/lib/python3.10/site-packages/scipy/optimize/__init__.py:412: in <module>
[2022-03-09T08:28:51.258Z] from ._linprog import linprog, linprog_verbose_callback
[2022-03-09T08:28:51.258Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog.py:23: in <module>
[2022-03-09T08:28:51.258Z] from ._linprog_ip import _linprog_ip
[2022-03-09T08:28:51.258Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog_ip.py:27: in <module>
[2022-03-09T08:28:51.258Z] from ._linprog_util import _postsolve
[2022-03-09T08:28:51.258Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog_util.py:9: in <module>
[2022-03-09T08:28:51.258Z] from scipy.optimize._remove_redundancy import (
[2022-03-09T08:28:51.258Z] /usr/lib/python3.10/site-packages/scipy/optimize/_remove_redundancy.py:9: in <module>
[2022-03-09T08:28:51.258Z] from scipy.linalg.interpolative import interp_decomp
[2022-03-09T08:28:51.258Z] /usr/lib/python3.10/site-packages/scipy/linalg/interpolative.py:385: in <module>
[2022-03-09T08:28:51.258Z] import scipy.linalg._interpolative_backend as _backend
[2022-03-09T08:28:51.258Z] _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
[2022-03-09T08:28:51.258Z]
[2022-03-09T08:28:51.258Z] #******************************************************************************
[2022-03-09T08:28:51.258Z] # Copyright (C) 2013 Kenneth L. Ho
[2022-03-09T08:28:51.258Z] #
[2022-03-09T08:28:51.258Z] # Redistribution and use in source and binary forms, with or without
[2022-03-09T08:28:51.258Z] # modification, are permitted provided that the following conditions are met:
[2022-03-09T08:28:51.258Z] #
[2022-03-09T08:28:51.258Z] # Redistributions of source code must retain the above copyright notice, this
[2022-03-09T08:28:51.258Z] # list of conditions and the following disclaimer. Redistributions in binary
[2022-03-09T08:28:51.258Z] # form must reproduce the above copyright notice, this list of conditions and
[2022-03-09T08:28:51.258Z] # the following disclaimer in the documentation and/or other materials
[2022-03-09T08:28:51.258Z] # provided with the distribution.
[2022-03-09T08:28:51.258Z] #
[2022-03-09T08:28:51.258Z] # None of the names of the copyright holders may be used to endorse or
[2022-03-09T08:28:51.258Z] # promote products derived from this software without specific prior written
[2022-03-09T08:28:51.258Z] # permission.
[2022-03-09T08:28:51.258Z] #
[2022-03-09T08:28:51.258Z] # THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
[2022-03-09T08:28:51.258Z] # AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
[2022-03-09T08:28:51.258Z] # IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
[2022-03-09T08:28:51.258Z] # ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
[2022-03-09T08:28:51.258Z] # LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
[2022-03-09T08:28:51.258Z] # CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
[2022-03-09T08:28:51.258Z] # SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
[2022-03-09T08:28:51.258Z] # INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
[2022-03-09T08:28:51.258Z] # CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
[2022-03-09T08:28:51.258Z] # ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
[2022-03-09T08:28:51.258Z] # POSSIBILITY OF SUCH DAMAGE.
[2022-03-09T08:28:51.258Z] #******************************************************************************
[2022-03-09T08:28:51.258Z]
[2022-03-09T08:28:51.258Z] """
[2022-03-09T08:28:51.258Z] Direct wrappers for Fortran `id_dist` backend.
[2022-03-09T08:28:51.258Z] """
[2022-03-09T08:28:51.258Z]
[2022-03-09T08:28:51.258Z] > import scipy.linalg._interpolative as _id
[2022-03-09T08:28:51.258Z] E ImportError: /usr/lib/python3.10/site-packages/scipy/linalg/_interpolative.cpython-310-x86_64-linux-gnu.so: undefined symbol: _ZGVbN2v_sin
[2022-03-09T08:28:51.258Z]
[2022-03-09T08:28:51.258Z] /usr/lib/python3.10/site-packages/scipy/linalg/_interpolative_backend.py:34: ImportError
[2022-03-09T08:28:51.258Z] _________________________ TestSimilarity.testGraph4_b __________________________
[2022-03-09T08:28:51.258Z]
[2022-03-09T08:28:51.258Z] self = <networkx.algorithms.tests.test_similarity.TestSimilarity object at 0x7fe884db2d10>
[2022-03-09T08:28:51.258Z]
[2022-03-09T08:28:51.258Z] def testGraph4_b(self):
[2022-03-09T08:28:51.258Z] G1 = getCanonical()
[2022-03-09T08:28:51.258Z] G2 = nx.Graph()
[2022-03-09T08:28:51.259Z] G2.add_node("A", label="A")
[2022-03-09T08:28:51.259Z] G2.add_node("B", label="B")
[2022-03-09T08:28:51.259Z] G2.add_node("C", label="C")
[2022-03-09T08:28:51.259Z] G2.add_node("D", label="D")
[2022-03-09T08:28:51.259Z] G2.add_edge("A", "B", label="a-b")
[2022-03-09T08:28:51.259Z] G2.add_edge("B", "C", label="b-c")
[2022-03-09T08:28:51.259Z] G2.add_edge("B", "D", label="bad")
[2022-03-09T08:28:51.259Z] > assert graph_edit_distance(G1, G2, node_match=nmatch, edge_match=ematch) == 1
[2022-03-09T08:28:51.259Z]
[2022-03-09T08:28:51.259Z] networkx/algorithms/tests/test_similarity.py:523:
[2022-03-09T08:28:51.259Z] _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
[2022-03-09T08:28:51.259Z] networkx/algorithms/similarity.py:190: in graph_edit_distance
[2022-03-09T08:28:51.259Z] for vertex_path, edge_path, cost in optimize_edit_paths(
[2022-03-09T08:28:51.259Z] networkx/algorithms/similarity.py:673: in optimize_edit_paths
[2022-03-09T08:28:51.259Z] import scipy.optimize # call as sp.optimize
[2022-03-09T08:28:51.259Z] /usr/lib/python3.10/site-packages/scipy/optimize/__init__.py:412: in <module>
[2022-03-09T08:28:51.259Z] from ._linprog import linprog, linprog_verbose_callback
[2022-03-09T08:28:51.259Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog.py:23: in <module>
[2022-03-09T08:28:51.259Z] from ._linprog_ip import _linprog_ip
[2022-03-09T08:28:51.259Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog_ip.py:27: in <module>
[2022-03-09T08:28:51.259Z] from ._linprog_util import _postsolve
[2022-03-09T08:28:51.259Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog_util.py:9: in <module>
[2022-03-09T08:28:51.259Z] from scipy.optimize._remove_redundancy import (
[2022-03-09T08:28:51.259Z] /usr/lib/python3.10/site-packages/scipy/optimize/_remove_redundancy.py:9: in <module>
[2022-03-09T08:28:51.259Z] from scipy.linalg.interpolative import interp_decomp
[2022-03-09T08:28:51.259Z] /usr/lib/python3.10/site-packages/scipy/linalg/interpolative.py:385: in <module>
[2022-03-09T08:28:51.259Z] import scipy.linalg._interpolative_backend as _backend
[2022-03-09T08:28:51.259Z] _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
[2022-03-09T08:28:51.259Z]
[2022-03-09T08:28:51.259Z] #******************************************************************************
[2022-03-09T08:28:51.259Z] # Copyright (C) 2013 Kenneth L. Ho
[2022-03-09T08:28:51.259Z] #
[2022-03-09T08:28:51.259Z] # Redistribution and use in source and binary forms, with or without
[2022-03-09T08:28:51.259Z] # modification, are permitted provided that the following conditions are met:
[2022-03-09T08:28:51.259Z] #
[2022-03-09T08:28:51.259Z] # Redistributions of source code must retain the above copyright notice, this
[2022-03-09T08:28:51.259Z] # list of conditions and the following disclaimer. Redistributions in binary
[2022-03-09T08:28:51.259Z] # form must reproduce the above copyright notice, this list of conditions and
[2022-03-09T08:28:51.259Z] # the following disclaimer in the documentation and/or other materials
[2022-03-09T08:28:51.259Z] # provided with the distribution.
[2022-03-09T08:28:51.259Z] #
[2022-03-09T08:28:51.259Z] # None of the names of the copyright holders may be used to endorse or
[2022-03-09T08:28:51.259Z] # promote products derived from this software without specific prior written
[2022-03-09T08:28:51.259Z] # permission.
[2022-03-09T08:28:51.259Z] #
[2022-03-09T08:28:51.259Z] # THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
[2022-03-09T08:28:51.259Z] # AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
[2022-03-09T08:28:51.259Z] # IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
[2022-03-09T08:28:51.259Z] # ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
[2022-03-09T08:28:51.259Z] # LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
[2022-03-09T08:28:51.259Z] # CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
[2022-03-09T08:28:51.259Z] # SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
[2022-03-09T08:28:51.259Z] # INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
[2022-03-09T08:28:51.259Z] # CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
[2022-03-09T08:28:51.259Z] # ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
[2022-03-09T08:28:51.259Z] # POSSIBILITY OF SUCH DAMAGE.
[2022-03-09T08:28:51.259Z] #******************************************************************************
[2022-03-09T08:28:51.259Z]
[2022-03-09T08:28:51.259Z] """
[2022-03-09T08:28:51.259Z] Direct wrappers for Fortran `id_dist` backend.
[2022-03-09T08:28:51.259Z] """
[2022-03-09T08:28:51.259Z]
[2022-03-09T08:28:51.259Z] > import scipy.linalg._interpolative as _id
[2022-03-09T08:28:51.259Z] E ImportError: /usr/lib/python3.10/site-packages/scipy/linalg/_interpolative.cpython-310-x86_64-linux-gnu.so: undefined symbol: _ZGVbN2v_sin
[2022-03-09T08:28:51.259Z]
[2022-03-09T08:28:51.259Z] /usr/lib/python3.10/site-packages/scipy/linalg/_interpolative_backend.py:34: ImportError
[2022-03-09T08:28:51.259Z] __________________________ TestLayout.test_smoke_int ___________________________
[2022-03-09T08:28:51.259Z]
[2022-03-09T08:28:51.259Z] self = <networkx.drawing.tests.test_layout.TestLayout object at 0x7fe8849ca530>
[2022-03-09T08:28:51.259Z]
[2022-03-09T08:28:51.259Z] def test_smoke_int(self):
[2022-03-09T08:28:51.259Z] G = self.Gi
[2022-03-09T08:28:51.259Z] nx.random_layout(G)
[2022-03-09T08:28:51.259Z] nx.circular_layout(G)
[2022-03-09T08:28:51.259Z] nx.planar_layout(G)
[2022-03-09T08:28:51.259Z] nx.spring_layout(G)
[2022-03-09T08:28:51.259Z] nx.fruchterman_reingold_layout(G)
[2022-03-09T08:28:51.259Z] nx.fruchterman_reingold_layout(self.bigG)
[2022-03-09T08:28:51.259Z] nx.spectral_layout(G)
[2022-03-09T08:28:51.259Z] nx.spectral_layout(G.to_directed())
[2022-03-09T08:28:51.260Z] nx.spectral_layout(self.bigG)
[2022-03-09T08:28:51.260Z] nx.spectral_layout(self.bigG.to_directed())
[2022-03-09T08:28:51.260Z] nx.shell_layout(G)
[2022-03-09T08:28:51.260Z] nx.spiral_layout(G)
[2022-03-09T08:28:51.260Z] > nx.kamada_kawai_layout(G)
[2022-03-09T08:28:51.260Z]
[2022-03-09T08:28:51.260Z] networkx/drawing/tests/test_layout.py:66:
[2022-03-09T08:28:51.260Z] _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
[2022-03-09T08:28:51.260Z] networkx/drawing/layout.py:709: in kamada_kawai_layout
[2022-03-09T08:28:51.260Z] pos = _kamada_kawai_solve(dist_mtx, pos_arr, dim)
[2022-03-09T08:28:51.260Z] networkx/drawing/layout.py:722: in _kamada_kawai_solve
[2022-03-09T08:28:51.260Z] import scipy.optimize # call as sp.optimize
[2022-03-09T08:28:51.260Z] /usr/lib/python3.10/site-packages/scipy/optimize/__init__.py:412: in <module>
[2022-03-09T08:28:51.260Z] from ._linprog import linprog, linprog_verbose_callback
[2022-03-09T08:28:51.260Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog.py:23: in <module>
[2022-03-09T08:28:51.260Z] from ._linprog_ip import _linprog_ip
[2022-03-09T08:28:51.260Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog_ip.py:27: in <module>
[2022-03-09T08:28:51.260Z] from ._linprog_util import _postsolve
[2022-03-09T08:28:51.260Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog_util.py:9: in <module>
[2022-03-09T08:28:51.260Z] from scipy.optimize._remove_redundancy import (
[2022-03-09T08:28:51.260Z] /usr/lib/python3.10/site-packages/scipy/optimize/_remove_redundancy.py:9: in <module>
[2022-03-09T08:28:51.260Z] from scipy.linalg.interpolative import interp_decomp
[2022-03-09T08:28:51.260Z] /usr/lib/python3.10/site-packages/scipy/linalg/interpolative.py:385: in <module>
[2022-03-09T08:28:51.260Z] import scipy.linalg._interpolative_backend as _backend
[2022-03-09T08:28:51.260Z] _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
[2022-03-09T08:28:51.260Z]
[2022-03-09T08:28:51.260Z] #******************************************************************************
[2022-03-09T08:28:51.260Z] # Copyright (C) 2013 Kenneth L. Ho
[2022-03-09T08:28:51.260Z] #
[2022-03-09T08:28:51.260Z] # Redistribution and use in source and binary forms, with or without
[2022-03-09T08:28:51.260Z] # modification, are permitted provided that the following conditions are met:
[2022-03-09T08:28:51.260Z] #
[2022-03-09T08:28:51.260Z] # Redistributions of source code must retain the above copyright notice, this
[2022-03-09T08:28:51.260Z] # list of conditions and the following disclaimer. Redistributions in binary
[2022-03-09T08:28:51.260Z] # form must reproduce the above copyright notice, this list of conditions and
[2022-03-09T08:28:51.260Z] # the following disclaimer in the documentation and/or other materials
[2022-03-09T08:28:51.260Z] # provided with the distribution.
[2022-03-09T08:28:51.260Z] #
[2022-03-09T08:28:51.260Z] # None of the names of the copyright holders may be used to endorse or
[2022-03-09T08:28:51.260Z] # promote products derived from this software without specific prior written
[2022-03-09T08:28:51.260Z] # permission.
[2022-03-09T08:28:51.260Z] #
[2022-03-09T08:28:51.260Z] # THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
[2022-03-09T08:28:51.260Z] # AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
[2022-03-09T08:28:51.260Z] # IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
[2022-03-09T08:28:51.260Z] # ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
[2022-03-09T08:28:51.260Z] # LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
[2022-03-09T08:28:51.260Z] # CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
[2022-03-09T08:28:51.260Z] # SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
[2022-03-09T08:28:51.260Z] # INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
[2022-03-09T08:28:51.260Z] # CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
[2022-03-09T08:28:51.260Z] # ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
[2022-03-09T08:28:51.260Z] # POSSIBILITY OF SUCH DAMAGE.
[2022-03-09T08:28:51.260Z] #******************************************************************************
[2022-03-09T08:28:51.260Z]
[2022-03-09T08:28:51.260Z] """
[2022-03-09T08:28:51.260Z] Direct wrappers for Fortran `id_dist` backend.
[2022-03-09T08:28:51.260Z] """
[2022-03-09T08:28:51.260Z]
[2022-03-09T08:28:51.260Z] > import scipy.linalg._interpolative as _id
[2022-03-09T08:28:51.260Z] E ImportError: /usr/lib/python3.10/site-packages/scipy/linalg/_interpolative.cpython-310-x86_64-linux-gnu.so: undefined symbol: _ZGVbN2v_sin
[2022-03-09T08:28:51.260Z]
[2022-03-09T08:28:51.260Z] /usr/lib/python3.10/site-packages/scipy/linalg/_interpolative_backend.py:34: ImportError
[2022-03-09T08:28:51.260Z] _________________________ TestLayout.test_smoke_string _________________________
[2022-03-09T08:28:51.260Z]
[2022-03-09T08:28:51.260Z] self = <networkx.drawing.tests.test_layout.TestLayout object at 0x7fe8849c9840>
[2022-03-09T08:28:51.260Z]
[2022-03-09T08:28:51.260Z] def test_smoke_string(self):
[2022-03-09T08:28:51.260Z] G = self.Gs
[2022-03-09T08:28:51.260Z] nx.random_layout(G)
[2022-03-09T08:28:51.260Z] nx.circular_layout(G)
[2022-03-09T08:28:51.260Z] nx.planar_layout(G)
[2022-03-09T08:28:51.260Z] nx.spring_layout(G)
[2022-03-09T08:28:51.260Z] nx.fruchterman_reingold_layout(G)
[2022-03-09T08:28:51.260Z] nx.spectral_layout(G)
[2022-03-09T08:28:51.260Z] nx.shell_layout(G)
[2022-03-09T08:28:51.260Z] nx.spiral_layout(G)
[2022-03-09T08:28:51.260Z] > nx.kamada_kawai_layout(G)
[2022-03-09T08:28:51.260Z]
[2022-03-09T08:28:51.260Z] networkx/drawing/tests/test_layout.py:80:
[2022-03-09T08:28:51.260Z] _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
[2022-03-09T08:28:51.260Z] networkx/drawing/layout.py:709: in kamada_kawai_layout
[2022-03-09T08:28:51.260Z] pos = _kamada_kawai_solve(dist_mtx, pos_arr, dim)
[2022-03-09T08:28:51.260Z] networkx/drawing/layout.py:722: in _kamada_kawai_solve
[2022-03-09T08:28:51.261Z] import scipy.optimize # call as sp.optimize
[2022-03-09T08:28:51.261Z] /usr/lib/python3.10/site-packages/scipy/optimize/__init__.py:412: in <module>
[2022-03-09T08:28:51.261Z] from ._linprog import linprog, linprog_verbose_callback
[2022-03-09T08:28:51.261Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog.py:23: in <module>
[2022-03-09T08:28:51.261Z] from ._linprog_ip import _linprog_ip
[2022-03-09T08:28:51.261Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog_ip.py:27: in <module>
[2022-03-09T08:28:51.261Z] from ._linprog_util import _postsolve
[2022-03-09T08:28:51.261Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog_util.py:9: in <module>
[2022-03-09T08:28:51.261Z] from scipy.optimize._remove_redundancy import (
[2022-03-09T08:28:51.261Z] /usr/lib/python3.10/site-packages/scipy/optimize/_remove_redundancy.py:9: in <module>
[2022-03-09T08:28:51.261Z] from scipy.linalg.interpolative import interp_decomp
[2022-03-09T08:28:51.261Z] /usr/lib/python3.10/site-packages/scipy/linalg/interpolative.py:385: in <module>
[2022-03-09T08:28:51.261Z] import scipy.linalg._interpolative_backend as _backend
[2022-03-09T08:28:51.261Z] _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
[2022-03-09T08:28:51.261Z]
[2022-03-09T08:28:51.261Z] #******************************************************************************
[2022-03-09T08:28:51.261Z] # Copyright (C) 2013 Kenneth L. Ho
[2022-03-09T08:28:51.261Z] #
[2022-03-09T08:28:51.261Z] # Redistribution and use in source and binary forms, with or without
[2022-03-09T08:28:51.261Z] # modification, are permitted provided that the following conditions are met:
[2022-03-09T08:28:51.261Z] #
[2022-03-09T08:28:51.261Z] # Redistributions of source code must retain the above copyright notice, this
[2022-03-09T08:28:51.261Z] # list of conditions and the following disclaimer. Redistributions in binary
[2022-03-09T08:28:51.261Z] # form must reproduce the above copyright notice, this list of conditions and
[2022-03-09T08:28:51.261Z] # the following disclaimer in the documentation and/or other materials
[2022-03-09T08:28:51.261Z] # provided with the distribution.
[2022-03-09T08:28:51.261Z] #
[2022-03-09T08:28:51.261Z] # None of the names of the copyright holders may be used to endorse or
[2022-03-09T08:28:51.261Z] # promote products derived from this software without specific prior written
[2022-03-09T08:28:51.261Z] # permission.
[2022-03-09T08:28:51.261Z] #
[2022-03-09T08:28:51.261Z] # THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
[2022-03-09T08:28:51.261Z] # AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
[2022-03-09T08:28:51.261Z] # IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
[2022-03-09T08:28:51.261Z] # ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
[2022-03-09T08:28:51.261Z] # LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
[2022-03-09T08:28:51.261Z] # CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
[2022-03-09T08:28:51.261Z] # SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
[2022-03-09T08:28:51.261Z] # INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
[2022-03-09T08:28:51.261Z] # CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
[2022-03-09T08:28:51.261Z] # ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
[2022-03-09T08:28:51.261Z] # POSSIBILITY OF SUCH DAMAGE.
[2022-03-09T08:28:51.261Z] #******************************************************************************
[2022-03-09T08:28:51.261Z]
[2022-03-09T08:28:51.261Z] """
[2022-03-09T08:28:51.261Z] Direct wrappers for Fortran `id_dist` backend.
[2022-03-09T08:28:51.261Z] """
[2022-03-09T08:28:51.261Z]
[2022-03-09T08:28:51.261Z] > import scipy.linalg._interpolative as _id
[2022-03-09T08:28:51.261Z] E ImportError: /usr/lib/python3.10/site-packages/scipy/linalg/_interpolative.cpython-310-x86_64-linux-gnu.so: undefined symbol: _ZGVbN2v_sin
[2022-03-09T08:28:51.261Z]
[2022-03-09T08:28:51.261Z] /usr/lib/python3.10/site-packages/scipy/linalg/_interpolative_backend.py:34: ImportError
[2022-03-09T08:28:51.261Z] _____________________ TestLayout.test_scale_and_center_arg _____________________
[2022-03-09T08:28:51.261Z]
[2022-03-09T08:28:51.261Z] self = <networkx.drawing.tests.test_layout.TestLayout object at 0x7fe8849c9c90>
[2022-03-09T08:28:51.261Z]
[2022-03-09T08:28:51.261Z] def test_scale_and_center_arg(self):
[2022-03-09T08:28:51.261Z] sc = self.check_scale_and_center
[2022-03-09T08:28:51.261Z] c = (4, 5)
[2022-03-09T08:28:51.261Z] G = nx.complete_graph(9)
[2022-03-09T08:28:51.261Z] G.add_node(9)
[2022-03-09T08:28:51.261Z] sc(nx.random_layout(G, center=c), scale=0.5, center=(4.5, 5.5))
[2022-03-09T08:28:51.261Z] # rest can have 2*scale length: [-scale, scale]
[2022-03-09T08:28:51.261Z] sc(nx.spring_layout(G, scale=2, center=c), scale=2, center=c)
[2022-03-09T08:28:51.261Z] sc(nx.spectral_layout(G, scale=2, center=c), scale=2, center=c)
[2022-03-09T08:28:51.261Z] sc(nx.circular_layout(G, scale=2, center=c), scale=2, center=c)
[2022-03-09T08:28:51.261Z] sc(nx.shell_layout(G, scale=2, center=c), scale=2, center=c)
[2022-03-09T08:28:51.261Z] sc(nx.spiral_layout(G, scale=2, center=c), scale=2, center=c)
[2022-03-09T08:28:51.261Z] > sc(nx.kamada_kawai_layout(G, scale=2, center=c), scale=2, center=c)
[2022-03-09T08:28:51.261Z]
[2022-03-09T08:28:51.261Z] networkx/drawing/tests/test_layout.py:106:
[2022-03-09T08:28:51.261Z] _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
[2022-03-09T08:28:51.261Z] networkx/drawing/layout.py:709: in kamada_kawai_layout
[2022-03-09T08:28:51.261Z] pos = _kamada_kawai_solve(dist_mtx, pos_arr, dim)
[2022-03-09T08:28:51.261Z] networkx/drawing/layout.py:722: in _kamada_kawai_solve
[2022-03-09T08:28:51.261Z] import scipy.optimize # call as sp.optimize
[2022-03-09T08:28:51.261Z] /usr/lib/python3.10/site-packages/scipy/optimize/__init__.py:412: in <module>
[2022-03-09T08:28:51.261Z] from ._linprog import linprog, linprog_verbose_callback
[2022-03-09T08:28:51.261Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog.py:23: in <module>
[2022-03-09T08:28:51.262Z] from ._linprog_ip import _linprog_ip
[2022-03-09T08:28:51.262Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog_ip.py:27: in <module>
[2022-03-09T08:28:51.262Z] from ._linprog_util import _postsolve
[2022-03-09T08:28:51.262Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog_util.py:9: in <module>
[2022-03-09T08:28:51.262Z] from scipy.optimize._remove_redundancy import (
[2022-03-09T08:28:51.262Z] /usr/lib/python3.10/site-packages/scipy/optimize/_remove_redundancy.py:9: in <module>
[2022-03-09T08:28:51.262Z] from scipy.linalg.interpolative import interp_decomp
[2022-03-09T08:28:51.262Z] /usr/lib/python3.10/site-packages/scipy/linalg/interpolative.py:385: in <module>
[2022-03-09T08:28:51.262Z] import scipy.linalg._interpolative_backend as _backend
[2022-03-09T08:28:51.262Z] _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
[2022-03-09T08:28:51.262Z]
[2022-03-09T08:28:51.262Z] #******************************************************************************
[2022-03-09T08:28:51.262Z] # Copyright (C) 2013 Kenneth L. Ho
[2022-03-09T08:28:51.262Z] #
[2022-03-09T08:28:51.262Z] # Redistribution and use in source and binary forms, with or without
[2022-03-09T08:28:51.262Z] # modification, are permitted provided that the following conditions are met:
[2022-03-09T08:28:51.262Z] #
[2022-03-09T08:28:51.262Z] # Redistributions of source code must retain the above copyright notice, this
[2022-03-09T08:28:51.262Z] # list of conditions and the following disclaimer. Redistributions in binary
[2022-03-09T08:28:51.262Z] # form must reproduce the above copyright notice, this list of conditions and
[2022-03-09T08:28:51.262Z] # the following disclaimer in the documentation and/or other materials
[2022-03-09T08:28:51.262Z] # provided with the distribution.
[2022-03-09T08:28:51.262Z] #
[2022-03-09T08:28:51.262Z] # None of the names of the copyright holders may be used to endorse or
[2022-03-09T08:28:51.262Z] # promote products derived from this software without specific prior written
[2022-03-09T08:28:51.262Z] # permission.
[2022-03-09T08:28:51.262Z] #
[2022-03-09T08:28:51.262Z] # THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
[2022-03-09T08:28:51.262Z] # AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
[2022-03-09T08:28:51.262Z] # IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
[2022-03-09T08:28:51.262Z] # ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
[2022-03-09T08:28:51.262Z] # LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
[2022-03-09T08:28:51.262Z] # CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
[2022-03-09T08:28:51.262Z] # SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
[2022-03-09T08:28:51.262Z] # INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
[2022-03-09T08:28:51.262Z] # CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
[2022-03-09T08:28:51.262Z] # ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
[2022-03-09T08:28:51.262Z] # POSSIBILITY OF SUCH DAMAGE.
[2022-03-09T08:28:51.262Z] #******************************************************************************
[2022-03-09T08:28:51.262Z]
[2022-03-09T08:28:51.262Z] """
[2022-03-09T08:28:51.262Z] Direct wrappers for Fortran `id_dist` backend.
[2022-03-09T08:28:51.262Z] """
[2022-03-09T08:28:51.262Z]
[2022-03-09T08:28:51.262Z] > import scipy.linalg._interpolative as _id
[2022-03-09T08:28:51.262Z] E ImportError: /usr/lib/python3.10/site-packages/scipy/linalg/_interpolative.cpython-310-x86_64-linux-gnu.so: undefined symbol: _ZGVbN2v_sin
[2022-03-09T08:28:51.262Z]
[2022-03-09T08:28:51.262Z] /usr/lib/python3.10/site-packages/scipy/linalg/_interpolative_backend.py:34: ImportError
[2022-03-09T08:28:51.262Z] ___________________ TestLayout.test_default_scale_and_center ___________________
[2022-03-09T08:28:51.262Z]
[2022-03-09T08:28:51.262Z] self = <networkx.drawing.tests.test_layout.TestLayout object at 0x7fe8849c9ea0>
[2022-03-09T08:28:51.262Z]
[2022-03-09T08:28:51.262Z] def test_default_scale_and_center(self):
[2022-03-09T08:28:51.262Z] sc = self.check_scale_and_center
[2022-03-09T08:28:51.262Z] c = (0, 0)
[2022-03-09T08:28:51.262Z] G = nx.complete_graph(9)
[2022-03-09T08:28:51.262Z] G.add_node(9)
[2022-03-09T08:28:51.262Z] sc(nx.random_layout(G), scale=0.5, center=(0.5, 0.5))
[2022-03-09T08:28:51.262Z] sc(nx.spring_layout(G), scale=1, center=c)
[2022-03-09T08:28:51.262Z] sc(nx.spectral_layout(G), scale=1, center=c)
[2022-03-09T08:28:51.262Z] sc(nx.circular_layout(G), scale=1, center=c)
[2022-03-09T08:28:51.262Z] sc(nx.shell_layout(G), scale=1, center=c)
[2022-03-09T08:28:51.262Z] sc(nx.spiral_layout(G), scale=1, center=c)
[2022-03-09T08:28:51.262Z] > sc(nx.kamada_kawai_layout(G), scale=1, center=c)
[2022-03-09T08:28:51.262Z]
[2022-03-09T08:28:51.262Z] networkx/drawing/tests/test_layout.py:131:
[2022-03-09T08:28:51.262Z] _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
[2022-03-09T08:28:51.262Z] networkx/drawing/layout.py:709: in kamada_kawai_layout
[2022-03-09T08:28:51.262Z] pos = _kamada_kawai_solve(dist_mtx, pos_arr, dim)
[2022-03-09T08:28:51.262Z] networkx/drawing/layout.py:722: in _kamada_kawai_solve
[2022-03-09T08:28:51.262Z] import scipy.optimize # call as sp.optimize
[2022-03-09T08:28:51.262Z] /usr/lib/python3.10/site-packages/scipy/optimize/__init__.py:412: in <module>
[2022-03-09T08:28:51.262Z] from ._linprog import linprog, linprog_verbose_callback
[2022-03-09T08:28:51.262Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog.py:23: in <module>
[2022-03-09T08:28:51.262Z] from ._linprog_ip import _linprog_ip
[2022-03-09T08:28:51.262Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog_ip.py:27: in <module>
[2022-03-09T08:28:51.262Z] from ._linprog_util import _postsolve
[2022-03-09T08:28:51.262Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog_util.py:9: in <module>
[2022-03-09T08:28:51.262Z] from scipy.optimize._remove_redundancy import (
[2022-03-09T08:28:51.262Z] /usr/lib/python3.10/site-packages/scipy/optimize/_remove_redundancy.py:9: in <module>
[2022-03-09T08:28:51.263Z] from scipy.linalg.interpolative import interp_decomp
[2022-03-09T08:28:51.263Z] /usr/lib/python3.10/site-packages/scipy/linalg/interpolative.py:385: in <module>
[2022-03-09T08:28:51.263Z] import scipy.linalg._interpolative_backend as _backend
[2022-03-09T08:28:51.263Z] _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
[2022-03-09T08:28:51.263Z]
[2022-03-09T08:28:51.263Z] #******************************************************************************
[2022-03-09T08:28:51.263Z] # Copyright (C) 2013 Kenneth L. Ho
[2022-03-09T08:28:51.263Z] #
[2022-03-09T08:28:51.263Z] # Redistribution and use in source and binary forms, with or without
[2022-03-09T08:28:51.263Z] # modification, are permitted provided that the following conditions are met:
[2022-03-09T08:28:51.263Z] #
[2022-03-09T08:28:51.263Z] # Redistributions of source code must retain the above copyright notice, this
[2022-03-09T08:28:51.263Z] # list of conditions and the following disclaimer. Redistributions in binary
[2022-03-09T08:28:51.263Z] # form must reproduce the above copyright notice, this list of conditions and
[2022-03-09T08:28:51.263Z] # the following disclaimer in the documentation and/or other materials
[2022-03-09T08:28:51.263Z] # provided with the distribution.
[2022-03-09T08:28:51.263Z] #
[2022-03-09T08:28:51.263Z] # None of the names of the copyright holders may be used to endorse or
[2022-03-09T08:28:51.263Z] # promote products derived from this software without specific prior written
[2022-03-09T08:28:51.263Z] # permission.
[2022-03-09T08:28:51.263Z] #
[2022-03-09T08:28:51.263Z] # THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
[2022-03-09T08:28:51.263Z] # AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
[2022-03-09T08:28:51.263Z] # IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
[2022-03-09T08:28:51.263Z] # ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
[2022-03-09T08:28:51.263Z] # LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
[2022-03-09T08:28:51.263Z] # CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
[2022-03-09T08:28:51.263Z] # SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
[2022-03-09T08:28:51.263Z] # INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
[2022-03-09T08:28:51.263Z] # CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
[2022-03-09T08:28:51.263Z] # ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
[2022-03-09T08:28:51.263Z] # POSSIBILITY OF SUCH DAMAGE.
[2022-03-09T08:28:51.263Z] #******************************************************************************
[2022-03-09T08:28:51.263Z]
[2022-03-09T08:28:51.263Z] """
[2022-03-09T08:28:51.263Z] Direct wrappers for Fortran `id_dist` backend.
[2022-03-09T08:28:51.263Z] """
[2022-03-09T08:28:51.263Z]
[2022-03-09T08:28:51.263Z] > import scipy.linalg._interpolative as _id
[2022-03-09T08:28:51.263Z] E ImportError: /usr/lib/python3.10/site-packages/scipy/linalg/_interpolative.cpython-310-x86_64-linux-gnu.so: undefined symbol: _ZGVbN2v_sin
[2022-03-09T08:28:51.263Z]
[2022-03-09T08:28:51.263Z] /usr/lib/python3.10/site-packages/scipy/linalg/_interpolative_backend.py:34: ImportError
[2022-03-09T08:28:51.263Z] __________________________________ test_draw ___________________________________
[2022-03-09T08:28:51.263Z]
[2022-03-09T08:28:51.263Z] def test_draw():
[2022-03-09T08:28:51.263Z] try:
[2022-03-09T08:28:51.263Z] functions = [
[2022-03-09T08:28:51.263Z] nx.draw_circular,
[2022-03-09T08:28:51.263Z] nx.draw_kamada_kawai,
[2022-03-09T08:28:51.263Z] nx.draw_planar,
[2022-03-09T08:28:51.263Z] nx.draw_random,
[2022-03-09T08:28:51.263Z] nx.draw_spectral,
[2022-03-09T08:28:51.263Z] nx.draw_spring,
[2022-03-09T08:28:51.263Z] nx.draw_shell,
[2022-03-09T08:28:51.263Z] ]
[2022-03-09T08:28:51.263Z] options = [{"node_color": "black", "node_size": 100, "width": 3}]
[2022-03-09T08:28:51.263Z] for function, option in itertools.product(functions, options):
[2022-03-09T08:28:51.263Z] > function(barbell, **option)
[2022-03-09T08:28:51.263Z]
[2022-03-09T08:28:51.263Z] networkx/drawing/tests/test_pylab.py:31:
[2022-03-09T08:28:51.263Z] _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
[2022-03-09T08:28:51.263Z] networkx/drawing/nx_pylab.py:1266: in draw_kamada_kawai
[2022-03-09T08:28:51.263Z] draw(G, kamada_kawai_layout(G), **kwargs)
[2022-03-09T08:28:51.263Z] networkx/drawing/layout.py:709: in kamada_kawai_layout
[2022-03-09T08:28:51.263Z] pos = _kamada_kawai_solve(dist_mtx, pos_arr, dim)
[2022-03-09T08:28:51.263Z] networkx/drawing/layout.py:722: in _kamada_kawai_solve
[2022-03-09T08:28:51.263Z] import scipy.optimize # call as sp.optimize
[2022-03-09T08:28:51.263Z] /usr/lib/python3.10/site-packages/scipy/optimize/__init__.py:412: in <module>
[2022-03-09T08:28:51.263Z] from ._linprog import linprog, linprog_verbose_callback
[2022-03-09T08:28:51.263Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog.py:23: in <module>
[2022-03-09T08:28:51.263Z] from ._linprog_ip import _linprog_ip
[2022-03-09T08:28:51.263Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog_ip.py:27: in <module>
[2022-03-09T08:28:51.263Z] from ._linprog_util import _postsolve
[2022-03-09T08:28:51.263Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog_util.py:9: in <module>
[2022-03-09T08:28:51.263Z] from scipy.optimize._remove_redundancy import (
[2022-03-09T08:28:51.263Z] /usr/lib/python3.10/site-packages/scipy/optimize/_remove_redundancy.py:9: in <module>
[2022-03-09T08:28:51.263Z] from scipy.linalg.interpolative import interp_decomp
[2022-03-09T08:28:51.263Z] /usr/lib/python3.10/site-packages/scipy/linalg/interpolative.py:385: in <module>
[2022-03-09T08:28:51.263Z] import scipy.linalg._interpolative_backend as _backend
[2022-03-09T08:28:51.263Z] _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
[2022-03-09T08:28:51.263Z]
[2022-03-09T08:28:51.263Z] #******************************************************************************
[2022-03-09T08:28:51.263Z] # Copyright (C) 2013 Kenneth L. Ho
[2022-03-09T08:28:51.264Z] #
[2022-03-09T08:28:51.264Z] # Redistribution and use in source and binary forms, with or without
[2022-03-09T08:28:51.264Z] # modification, are permitted provided that the following conditions are met:
[2022-03-09T08:28:51.264Z] #
[2022-03-09T08:28:51.264Z] # Redistributions of source code must retain the above copyright notice, this
[2022-03-09T08:28:51.264Z] # list of conditions and the following disclaimer. Redistributions in binary
[2022-03-09T08:28:51.264Z] # form must reproduce the above copyright notice, this list of conditions and
[2022-03-09T08:28:51.264Z] # the following disclaimer in the documentation and/or other materials
[2022-03-09T08:28:51.264Z] # provided with the distribution.
[2022-03-09T08:28:51.264Z] #
[2022-03-09T08:28:51.264Z] # None of the names of the copyright holders may be used to endorse or
[2022-03-09T08:28:51.264Z] # promote products derived from this software without specific prior written
[2022-03-09T08:28:51.264Z] # permission.
[2022-03-09T08:28:51.264Z] #
[2022-03-09T08:28:51.264Z] # THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
[2022-03-09T08:28:51.264Z] # AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
[2022-03-09T08:28:51.264Z] # IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
[2022-03-09T08:28:51.264Z] # ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
[2022-03-09T08:28:51.264Z] # LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
[2022-03-09T08:28:51.264Z] # CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
[2022-03-09T08:28:51.264Z] # SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
[2022-03-09T08:28:51.264Z] # INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
[2022-03-09T08:28:51.264Z] # CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
[2022-03-09T08:28:51.264Z] # ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
[2022-03-09T08:28:51.264Z] # POSSIBILITY OF SUCH DAMAGE.
[2022-03-09T08:28:51.264Z] #******************************************************************************
[2022-03-09T08:28:51.264Z]
[2022-03-09T08:28:51.264Z] """
[2022-03-09T08:28:51.264Z] Direct wrappers for Fortran `id_dist` backend.
[2022-03-09T08:28:51.264Z] """
[2022-03-09T08:28:51.264Z]
[2022-03-09T08:28:51.264Z] > import scipy.linalg._interpolative as _id
[2022-03-09T08:28:51.264Z] E ImportError: /usr/lib/python3.10/site-packages/scipy/linalg/_interpolative.cpython-310-x86_64-linux-gnu.so: undefined symbol: _ZGVbN2v_sin
[2022-03-09T08:28:51.264Z]
[2022-03-09T08:28:51.264Z] /usr/lib/python3.10/site-packages/scipy/linalg/_interpolative_backend.py:34: ImportError
[2022-03-09T08:28:51.264Z] __________________________ test_spectral_graph_forge ___________________________
[2022-03-09T08:28:51.264Z]
[2022-03-09T08:28:51.264Z] def test_spectral_graph_forge():
[2022-03-09T08:28:51.264Z] G = karate_club_graph()
[2022-03-09T08:28:51.264Z]
[2022-03-09T08:28:51.264Z] seed = 54321
[2022-03-09T08:28:51.264Z]
[2022-03-09T08:28:51.264Z] # common cases, just checking node number preserving and difference
[2022-03-09T08:28:51.264Z] # between identity and modularity cases
[2022-03-09T08:28:51.264Z] > H = spectral_graph_forge(G, 0.1, transformation="identity", seed=seed)
[2022-03-09T08:28:51.264Z]
[2022-03-09T08:28:51.264Z] networkx/generators/tests/test_spectral_graph_forge.py:21:
[2022-03-09T08:28:51.264Z] _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
[2022-03-09T08:28:51.264Z] networkx/utils/decorators.py:816: in func
[2022-03-09T08:28:51.264Z] return argmap._lazy_compile(__wrapper)(*args, **kwargs)
[2022-03-09T08:28:51.264Z] <class 'networkx.utils.decorators.argmap'> compilation 1455:4: in argmap_spectral_graph_forge_1452
[2022-03-09T08:28:51.264Z] ???
[2022-03-09T08:28:51.264Z] networkx/generators/spectral_graph_forge.py:145: in spectral_graph_forge
[2022-03-09T08:28:51.264Z] import scipy.stats # call as sp.stats
[2022-03-09T08:28:51.264Z] /usr/lib/python3.10/site-packages/scipy/stats/__init__.py:453: in <module>
[2022-03-09T08:28:51.264Z] from ._stats_py import *
[2022-03-09T08:28:51.264Z] /usr/lib/python3.10/site-packages/scipy/stats/_stats_py.py:44: in <module>
[2022-03-09T08:28:51.264Z] from . import distributions
[2022-03-09T08:28:51.264Z] /usr/lib/python3.10/site-packages/scipy/stats/distributions.py:8: in <module>
[2022-03-09T08:28:51.264Z] from ._distn_infrastructure import (rv_discrete, rv_continuous, rv_frozen)
[2022-03-09T08:28:51.264Z] /usr/lib/python3.10/site-packages/scipy/stats/_distn_infrastructure.py:24: in <module>
[2022-03-09T08:28:51.264Z] from scipy import optimize
[2022-03-09T08:28:51.264Z] /usr/lib/python3.10/site-packages/scipy/optimize/__init__.py:412: in <module>
[2022-03-09T08:28:51.264Z] from ._linprog import linprog, linprog_verbose_callback
[2022-03-09T08:28:51.264Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog.py:23: in <module>
[2022-03-09T08:28:51.264Z] from ._linprog_ip import _linprog_ip
[2022-03-09T08:28:51.264Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog_ip.py:27: in <module>
[2022-03-09T08:28:51.264Z] from ._linprog_util import _postsolve
[2022-03-09T08:28:51.264Z] /usr/lib/python3.10/site-packages/scipy/optimize/_linprog_util.py:9: in <module>
[2022-03-09T08:28:51.264Z] from scipy.optimize._remove_redundancy import (
[2022-03-09T08:28:51.264Z] /usr/lib/python3.10/site-packages/scipy/optimize/_remove_redundancy.py:9: in <module>
[2022-03-09T08:28:51.264Z] from scipy.linalg.interpolative import interp_decomp
[2022-03-09T08:28:51.264Z] /usr/lib/python3.10/site-packages/scipy/linalg/interpolative.py:385: in <module>
[2022-03-09T08:28:51.264Z] import scipy.linalg._interpolative_backend as _backend
[2022-03-09T08:28:51.264Z] _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
[2022-03-09T08:28:51.264Z]
[2022-03-09T08:28:51.264Z] #******************************************************************************
[2022-03-09T08:28:51.264Z] # Copyright (C) 2013 Kenneth L. Ho
[2022-03-09T08:28:51.264Z] #
[2022-03-09T08:28:51.264Z] # Redistribution and use in source and binary forms, with or without
[2022-03-09T08:28:51.265Z] # modification, are permitted provided that the following conditions are met:
[2022-03-09T08:28:51.265Z] #
[2022-03-09T08:28:51.265Z] # Redistributions of source code must retain the above copyright notice, this
[2022-03-09T08:28:51.265Z] # list of conditions and the following disclaimer. Redistributions in binary
[2022-03-09T08:28:51.265Z] # form must reproduce the above copyright notice, this list of conditions and
[2022-03-09T08:28:51.265Z] # the following disclaimer in the documentation and/or other materials
[2022-03-09T08:28:51.265Z] # provided with the distribution.
[2022-03-09T08:28:51.265Z] #
[2022-03-09T08:28:51.265Z] # None of the names of the copyright holders may be used to endorse or
[2022-03-09T08:28:51.265Z] # promote products derived from this software without specific prior written
[2022-03-09T08:28:51.265Z] # permission.
[2022-03-09T08:28:51.265Z] #
[2022-03-09T08:28:51.265Z] # THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
[2022-03-09T08:28:51.265Z] # AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
[2022-03-09T08:28:51.265Z] # IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
[2022-03-09T08:28:51.265Z] # ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
[2022-03-09T08:28:51.265Z] # LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
[2022-03-09T08:28:51.265Z] # CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
[2022-03-09T08:28:51.265Z] # SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
[2022-03-09T08:28:51.265Z] # INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
[2022-03-09T08:28:51.265Z] # CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
[2022-03-09T08:28:51.265Z] # ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
[2022-03-09T08:28:51.265Z] # POSSIBILITY OF SUCH DAMAGE.
[2022-03-09T08:28:51.265Z] #******************************************************************************
[2022-03-09T08:28:51.265Z]
[2022-03-09T08:28:51.265Z] """
[2022-03-09T08:28:51.265Z] Direct wrappers for Fortran `id_dist` backend.
[2022-03-09T08:28:51.265Z] """
[2022-03-09T08:28:51.265Z]
[2022-03-09T08:28:51.265Z] > import scipy.linalg._interpolative as _id
[2022-03-09T08:28:51.265Z] E ImportError: /usr/lib/python3.10/site-packages/scipy/linalg/_interpolative.cpython-310-x86_64-linux-gnu.so: undefined symbol: _ZGVbN2v_sin
[2022-03-09T08:28:51.265Z]
[2022-03-09T08:28:51.265Z] /usr/lib/python3.10/site-packages/scipy/linalg/_interpolative_backend.py:34: ImportError
[2022-03-09T08:28:51.265Z] =============================== warnings summary ===============================
[2022-03-09T08:28:51.265Z] networkx/drawing/tests/test_pylab.py:419
[2022-03-09T08:28:51.265Z] /build/python-networkx/src/networkx-networkx-2.7/networkx/drawing/tests/test_pylab.py:419: PytestUnknownMarkWarning: Unknown pytest.mark.mpl_image_compare - is this a typo? You can register custom marks to avoid this warning - for details, see https://docs.pytest.org/en/stable/how-to/mark.html
[2022-03-09T08:28:51.265Z] @pytest.mark.mpl_image_compare
[2022-03-09T08:28:51.265Z]
[2022-03-09T08:28:51.265Z] networkx/utils/decorators.py:292
[2022-03-09T08:28:51.265Z] /build/python-networkx/src/networkx-networkx-2.7/networkx/utils/decorators.py:292: DeprecationWarning: preserve_random_state is deprecated and will be removed in 3.0.
[2022-03-09T08:28:51.265Z] warnings.warn(msg, DeprecationWarning)
[2022-03-09T08:28:51.265Z]
[2022-03-09T08:28:51.265Z] networkx/classes/tests/test_ordered.py::TestOrderedFeatures::test_subgraph_order
[2022-03-09T08:28:51.265Z] /build/python-networkx/src/networkx-networkx-2.7/networkx/classes/tests/test_ordered.py:22: DeprecationWarning: OrderedDiGraph is deprecated and will be removed in version 3.0.
[2022-03-09T08:28:51.265Z] Use `DiGraph` instead, which guarantees order is preserved for
[2022-03-09T08:28:51.265Z] Python >= 3.7
[2022-03-09T08:28:51.265Z]
[2022-03-09T08:28:51.265Z] cls.G = nx.OrderedDiGraph()
[2022-03-09T08:28:51.265Z]
[2022-03-09T08:28:51.265Z] networkx/linalg/tests/test_algebraic_connectivity.py::TestSpectralOrdering::test_cycle[lobpcg-False-expected_order0]
[2022-03-09T08:28:51.265Z] /build/python-networkx/src/networkx-networkx-2.7/networkx/linalg/algebraicconnectivity.py:301: UserWarning: Exited at iteration 10 with accuracies
[2022-03-09T08:28:51.265Z] [0.02743716]
[2022-03-09T08:28:51.265Z] not reaching the requested tolerance 1e-08.
[2022-03-09T08:28:51.265Z] sigma, X = sp.sparse.linalg.lobpcg(
[2022-03-09T08:28:51.265Z]
[2022-03-09T08:28:51.265Z] networkx/linalg/tests/test_algebraic_connectivity.py::TestSpectralOrdering::test_cycle[lobpcg-True-expected_order1]
[2022-03-09T08:28:51.265Z] /build/python-networkx/src/networkx-networkx-2.7/networkx/linalg/algebraicconnectivity.py:301: UserWarning: Exited at iteration 10 with accuracies
[2022-03-09T08:28:51.265Z] [0.00056623]
[2022-03-09T08:28:51.265Z] not reaching the requested tolerance 1e-08.
[2022-03-09T08:28:51.265Z] sigma, X = sp.sparse.linalg.lobpcg(
[2022-03-09T08:28:51.265Z]
[2022-03-09T08:28:51.265Z] -- Docs: https://docs.pytest.org/en/stable/how-to/capture-warnings.html
[2022-03-09T08:28:51.265Z] =========================== short test summary info ============================
[2022-03-09T08:28:51.265Z] FAILED networkx/algorithms/approximation/tests/test_traveling_salesman.py::test_held_karp_ascent
[2022-03-09T08:28:51.265Z] FAILED networkx/algorithms/approximation/tests/test_traveling_salesman.py::test_ascent_fractional_solution
[2022-03-09T08:28:51.265Z] FAILED networkx/algorithms/approximation/tests/test_traveling_salesman.py::test_ascent_method_asymmetric
[2022-03-09T08:28:51.265Z] FAILED networkx/algorithms/approximation/tests/test_traveling_salesman.py::test_ascent_method_asymmetric_2
[2022-03-09T08:28:51.265Z] FAILED networkx/algorithms/approximation/tests/test_traveling_salesman.py::test_held_karp_ascent_asymmetric_3
[2022-03-09T08:28:51.265Z] FAILED networkx/algorithms/approximation/tests/test_traveling_salesman.py::test_held_karp_ascent_fractional_asymmetric
[2022-03-09T08:28:51.266Z] FAILED networkx/algorithms/approximation/tests/test_traveling_salesman.py::test_asadpour_tsp
[2022-03-09T08:28:51.266Z] FAILED networkx/algorithms/approximation/tests/test_traveling_salesman.py::test_asadpour_real_world
[2022-03-09T08:28:51.266Z] FAILED networkx/algorithms/approximation/tests/test_traveling_salesman.py::test_asadpour_real_world_path
[2022-03-09T08:28:51.266Z] FAILED networkx/algorithms/assortativity/tests/test_correlation.py::TestDegreeMixingCorrelation::test_degree_pearson_assortativity_undirected
[2022-03-09T08:28:51.266Z] FAILED networkx/algorithms/assortativity/tests/test_correlation.py::TestDegreeMixingCorrelation::test_degree_pearson_assortativity_directed
[2022-03-09T08:28:51.266Z] FAILED networkx/algorithms/assortativity/tests/test_correlation.py::TestDegreeMixingCorrelation::test_degree_pearson_assortativity_directed2
[2022-03-09T08:28:51.266Z] FAILED networkx/algorithms/assortativity/tests/test_correlation.py::TestDegreeMixingCorrelation::test_degree_pearson_assortativity_multigraph
[2022-03-09T08:28:51.266Z] FAILED networkx/algorithms/bipartite/tests/test_matching.py::TestMinimumWeightFullMatching::test_minimum_weight_full_matching_incomplete_graph
[2022-03-09T08:28:51.266Z] FAILED networkx/algorithms/bipartite/tests/test_matching.py::TestMinimumWeightFullMatching::test_minimum_weight_full_matching_with_no_full_matching
[2022-03-09T08:28:51.266Z] FAILED networkx/algorithms/bipartite/tests/test_matching.py::TestMinimumWeightFullMatching::test_minimum_weight_full_matching_square
[2022-03-09T08:28:51.266Z] FAILED networkx/algorithms/bipartite/tests/test_matching.py::TestMinimumWeightFullMatching::test_minimum_weight_full_matching_smaller_left
[2022-03-09T08:28:51.266Z] FAILED networkx/algorithms/bipartite/tests/test_matching.py::TestMinimumWeightFullMatching::test_minimum_weight_full_matching_smaller_top_nodes_right
[2022-03-09T08:28:51.266Z] FAILED networkx/algorithms/bipartite/tests/test_matching.py::TestMinimumWeightFullMatching::test_minimum_weight_full_matching_smaller_right
[2022-03-09T08:28:51.266Z] FAILED networkx/algorithms/bipartite/tests/test_matching.py::TestMinimumWeightFullMatching::test_minimum_weight_full_matching_negative_weights
[2022-03-09T08:28:51.266Z] FAILED networkx/algorithms/bipartite/tests/test_matching.py::TestMinimumWeightFullMatching::test_minimum_weight_full_matching_different_weight_key
[2022-03-09T08:28:51.266Z] FAILED networkx/algorithms/tests/test_similarity.py::TestSimilarity::test_graph_edit_distance_roots_and_timeout
[2022-03-09T08:28:51.266Z] FAILED networkx/algorithms/tests/test_similarity.py::TestSimilarity::test_graph_edit_distance
[2022-03-09T08:28:51.266Z] FAILED networkx/algorithms/tests/test_similarity.py::TestSimilarity::test_graph_edit_distance_node_match
[2022-03-09T08:28:51.266Z] FAILED networkx/algorithms/tests/test_similarity.py::TestSimilarity::test_graph_edit_distance_edge_match
[2022-03-09T08:28:51.266Z] FAILED networkx/algorithms/tests/test_similarity.py::TestSimilarity::test_graph_edit_distance_node_cost
[2022-03-09T08:28:51.266Z] FAILED networkx/algorithms/tests/test_similarity.py::TestSimilarity::test_graph_edit_distance_edge_cost
[2022-03-09T08:28:51.266Z] FAILED networkx/algorithms/tests/test_similarity.py::TestSimilarity::test_graph_edit_distance_upper_bound
[2022-03-09T08:28:51.266Z] FAILED networkx/algorithms/tests/test_similarity.py::TestSimilarity::test_optimal_edit_paths
[2022-03-09T08:28:51.266Z] FAILED networkx/algorithms/tests/test_similarity.py::TestSimilarity::test_optimize_graph_edit_distance
[2022-03-09T08:28:51.266Z] FAILED networkx/algorithms/tests/test_similarity.py::TestSimilarity::test_selfloops
[2022-03-09T08:28:51.266Z] FAILED networkx/algorithms/tests/test_similarity.py::TestSimilarity::test_digraph
[2022-03-09T08:28:51.266Z] FAILED networkx/algorithms/tests/test_similarity.py::TestSimilarity::test_multigraph
[2022-03-09T08:28:51.266Z] FAILED networkx/algorithms/tests/test_similarity.py::TestSimilarity::test_multidigraph
[2022-03-09T08:28:51.266Z] FAILED networkx/algorithms/tests/test_similarity.py::TestSimilarity::testCopy
[2022-03-09T08:28:51.266Z] FAILED networkx/algorithms/tests/test_similarity.py::TestSimilarity::testSame
[2022-03-09T08:28:51.266Z] FAILED networkx/algorithms/tests/test_similarity.py::TestSimilarity::testOneEdgeLabelDiff
[2022-03-09T08:28:51.266Z] FAILED networkx/algorithms/tests/test_similarity.py::TestSimilarity::testOneNodeLabelDiff
[2022-03-09T08:28:51.266Z] FAILED networkx/algorithms/tests/test_similarity.py::TestSimilarity::testOneExtraNode
[2022-03-09T08:28:51.266Z] FAILED networkx/algorithms/tests/test_similarity.py::TestSimilarity::testOneExtraEdge
[2022-03-09T08:28:51.266Z] FAILED networkx/algorithms/tests/test_similarity.py::TestSimilarity::testOneExtraNodeAndEdge
[2022-03-09T08:28:51.266Z] FAILED networkx/algorithms/tests/test_similarity.py::TestSimilarity::testGraph1
[2022-03-09T08:28:51.266Z] FAILED networkx/algorithms/tests/test_similarity.py::TestSimilarity::testGraph2
[2022-03-09T08:28:51.266Z] FAILED networkx/algorithms/tests/test_similarity.py::TestSimilarity::testGraph3
[2022-03-09T08:28:51.266Z] FAILED networkx/algorithms/tests/test_similarity.py::TestSimilarity::testGraph4
[2022-03-09T08:28:51.266Z] FAILED networkx/algorithms/tests/test_similarity.py::TestSimilarity::testGraph4_a
[2022-03-09T08:28:51.266Z] FAILED networkx/algorithms/tests/test_similarity.py::TestSimilarity::testGraph4_b
[2022-03-09T08:28:51.266Z] FAILED networkx/drawing/tests/test_layout.py::TestLayout::test_smoke_int - Im...
[2022-03-09T08:28:51.266Z] FAILED networkx/drawing/tests/test_layout.py::TestLayout::test_smoke_string
[2022-03-09T08:28:51.266Z] FAILED networkx/drawing/tests/test_layout.py::TestLayout::test_scale_and_center_arg
[2022-03-09T08:28:51.266Z] FAILED networkx/drawing/tests/test_layout.py::TestLayout::test_default_scale_and_center
[2022-03-09T08:28:51.266Z] FAILED networkx/drawing/tests/test_pylab.py::test_draw - ImportError: /usr/li...
[2022-03-09T08:28:51.267Z] FAILED networkx/generators/tests/test_spectral_graph_forge.py::test_spectral_graph_forge
[2022-03-09T08:28:51.267Z] = 53 failed, 4809 passed, 12 skipped, 3 xpassed, 5 warnings in 135.14s (0:02:15) =
[2022-03-09T08:28:52.177Z] ==> ERROR: A failure occurred in check().
[2022-03-09T08:28:52.177Z] Aborting...
[2022-03-09T08:28:54.039Z] ==> ERROR: Build failed, check /build/buildpkg/default-x86_64/jenkins/build
[Pipeline] }
[2022-03-09T08:28:54.044Z] ERROR: Failed to build source
[2022-03-09T08:28:54.044Z] ERROR: script returned exit code 255
[Pipeline] // catchError
[Pipeline] }
[Pipeline] // dir
Post stage
[Pipeline] emailext
[2022-03-09T08:28:54.130Z] Sending email to: artix-build-failures at artixlinux.org
More information about the artix-build-failures
mailing list