[INFO] fetching crate retworkx 0.8.0...
[INFO] documenting retworkx-0.8.0 against 1.69.0 for beta-1.70-rustdoc-1
[INFO] extracting crate retworkx 0.8.0 into /workspace/builds/worker-3-tc1/source
[INFO] validating manifest of crates.io crate retworkx 0.8.0 on toolchain 1.69.0
[INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+1.69.0" "metadata" "--manifest-path" "Cargo.toml" "--no-deps", kill_on_drop: false }`
[INFO] removed /workspace/builds/worker-3-tc1/source/.cargo/config
[INFO] started tweaking crates.io crate retworkx 0.8.0
[INFO] finished tweaking crates.io crate retworkx 0.8.0
[INFO] tweaked toml for crates.io crate retworkx 0.8.0 written to /workspace/builds/worker-3-tc1/source/Cargo.toml
[INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" __CARGO_TEST_CHANNEL_OVERRIDE_DO_NOT_USE_THIS="nightly" "/workspace/cargo-home/bin/cargo" "+1.69.0" "generate-lockfile" "--manifest-path" "Cargo.toml" "-Zno-index-update", kill_on_drop: false }`
[INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+1.69.0" "fetch" "--manifest-path" "Cargo.toml", kill_on_drop: false }`
[INFO] [stderr]  Downloading crates ...
[INFO] [stderr]   Downloaded pyo3cls v0.12.4
[INFO] [stderr]   Downloaded numpy v0.12.2
[INFO] [stderr]   Downloaded pyo3-derive-backend v0.12.4
[INFO] [stderr]   Downloaded indoc-impl v0.3.6
[INFO] [stderr]   Downloaded indoc v0.3.6
[INFO] [stderr]   Downloaded pyo3 v0.12.4
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-3-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-3-tc1/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:5ff2268d62e97bff2cde7d5815dd6ed5b47097566f13b8d0ca110b04b60e07ed" "/opt/rustwide/cargo-home/bin/cargo" "+1.69.0" "metadata" "--no-deps" "--format-version=1", kill_on_drop: false }`
[INFO] [stdout] 86a14937994092604d00ca402ac87908180726b6edf6c4df384dbd292a966036
[INFO] running `Command { std: "docker" "start" "-a" "86a14937994092604d00ca402ac87908180726b6edf6c4df384dbd292a966036", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "inspect" "86a14937994092604d00ca402ac87908180726b6edf6c4df384dbd292a966036", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "86a14937994092604d00ca402ac87908180726b6edf6c4df384dbd292a966036", kill_on_drop: false }`
[INFO] [stdout] 86a14937994092604d00ca402ac87908180726b6edf6c4df384dbd292a966036
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-3-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-3-tc1/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_INCREMENTAL=0" "-e" "RUST_BACKTRACE=full" "-e" "RUSTFLAGS=--cap-lints=warn" "-e" "RUSTDOCFLAGS=--cap-lints=warn" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:5ff2268d62e97bff2cde7d5815dd6ed5b47097566f13b8d0ca110b04b60e07ed" "/opt/rustwide/cargo-home/bin/cargo" "+1.69.0" "doc" "--frozen" "--no-deps" "--document-private-items" "--message-format=json", kill_on_drop: false }`
[INFO] [stdout] 125fe88f83ba639818534763ee2fc9164ca11e22c1f5d2e13569ae7d567eaea0
[INFO] running `Command { std: "docker" "start" "-a" "125fe88f83ba639818534763ee2fc9164ca11e22c1f5d2e13569ae7d567eaea0", kill_on_drop: false }`
[INFO] [stderr]    Compiling unicode-ident v1.0.8
[INFO] [stderr]    Compiling syn v1.0.109
[INFO] [stderr]    Compiling crossbeam-utils v0.8.15
[INFO] [stderr]    Compiling memoffset v0.8.0
[INFO] [stderr]     Checking scopeguard v1.1.0
[INFO] [stderr]    Compiling crossbeam-epoch v0.9.14
[INFO] [stderr]    Compiling proc-macro-hack v0.5.20+deprecated
[INFO] [stderr]    Compiling rayon-core v1.11.0
[INFO] [stderr]    Compiling lock_api v0.4.9
[INFO] [stderr]    Compiling parking_lot_core v0.8.6
[INFO] [stderr]     Checking either v1.8.1
[INFO] [stderr]     Checking instant v0.1.12
[INFO] [stderr]     Checking num_cpus v1.15.0
[INFO] [stderr]     Checking getrandom v0.2.9
[INFO] [stderr]    Compiling num-integer v0.1.45
[INFO] [stderr]    Compiling num-complex v0.2.4
[INFO] [stderr]    Compiling unindent v0.1.11
[INFO] [stderr]     Checking smallvec v1.10.0
[INFO] [stderr]    Compiling proc-macro2 v1.0.56
[INFO] [stderr]    Compiling inventory v0.1.11
[INFO] [stderr]    Compiling indexmap v1.9.3
[INFO] [stderr]     Checking rand_core v0.6.4
[INFO] [stderr]     Checking rawpointer v0.2.1
[INFO] [stderr]     Checking ahash v0.4.7
[INFO] [stderr]    Compiling pyo3 v0.12.4
[INFO] [stderr]    Compiling ndarray v0.13.1
[INFO] [stderr]     Checking matrixmultiply v0.2.4
[INFO] [stderr]     Checking ppv-lite86 v0.2.17
[INFO] [stderr]     Checking hashbrown v0.12.3
[INFO] [stderr]     Checking fixedbitset v0.2.0
[INFO] [stderr]     Checking rand_pcg v0.3.1
[INFO] [stderr]    Compiling quote v1.0.26
[INFO] [stderr]     Checking parking_lot v0.11.2
[INFO] [stderr]     Checking crossbeam-channel v0.5.8
[INFO] [stderr]    Compiling syn v2.0.15
[INFO] [stderr]     Checking rand_chacha v0.3.1
[INFO] [stderr]     Checking crossbeam-deque v0.8.3
[INFO] [stderr]     Checking rand v0.8.5
[INFO] [stderr]    Compiling paste-impl v0.1.18
[INFO] [stderr]     Checking petgraph v0.5.1
[INFO] [stderr]     Checking paste v0.1.18
[INFO] [stderr]     Checking rayon v1.7.0
[INFO] [stderr]    Compiling ghost v0.1.9
[INFO] [stderr]     Checking hashbrown v0.9.1
[INFO] [stderr]    Compiling pyo3-derive-backend v0.12.4
[INFO] [stderr]    Compiling inventory-impl v0.1.11
[INFO] [stderr]    Compiling ctor v0.1.26
[INFO] [stderr]    Compiling indoc-impl v0.3.6
[INFO] [stderr]    Compiling pyo3cls v0.12.4
[INFO] [stderr]     Checking indoc v0.3.6
[INFO] [stderr]     Checking numpy v0.12.2
[INFO] [stderr]  Documenting retworkx v0.8.0 (/opt/rustwide/workdir)
[INFO] [stdout] warning: unresolved link to `i`
[INFO] [stdout]   --> src/dag_isomorphism.rs:36:13
[INFO] [stdout]    |
[INFO] [stdout] 36 |     /// out[i] is non-zero if i is in either M_0(s) or Tout_0(s)
[INFO] [stdout]    |             ^ no item named `i` in scope
[INFO] [stdout]    |
[INFO] [stdout]    = help: to escape `[` and `]` characters, add '\' before them like `\[` or `\]`
[INFO] [stdout]    = note: `#[warn(rustdoc::broken_intra_doc_links)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unresolved link to `i`
[INFO] [stdout]   --> src/dag_isomorphism.rs:40:13
[INFO] [stdout]    |
[INFO] [stdout] 40 |     /// ins[i] is non-zero if i is in either M_0(s) or Tin_0(s)
[INFO] [stdout]    |             ^ no item named `i` in scope
[INFO] [stdout]    |
[INFO] [stdout]    = help: to escape `[` and `]` characters, add '\' before them like `\[` or `\]`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unresolved link to `Graph`
[INFO] [stdout]    --> src/dag_isomorphism.rs:167:6
[INFO] [stdout]     |
[INFO] [stdout] 167 | /// [Graph] Return `true` if the graphs `g0` and `g1` are isomorphic.
[INFO] [stdout]     |      ^^^^^ no item named `Graph` in scope
[INFO] [stdout]     |
[INFO] [stdout]     = help: to escape `[` and `]` characters, add '\' before them like `\[` or `\]`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unresolved link to `Graph`
[INFO] [stdout]    --> src/dag_isomorphism.rs:228:6
[INFO] [stdout]     |
[INFO] [stdout] 228 | /// [Graph] Return `true` if the graphs `g0` and `g1` are isomorphic.
[INFO] [stdout]     |      ^^^^^ no item named `Graph` in scope
[INFO] [stdout]     |
[INFO] [stdout]     = help: to escape `[` and `]` characters, add '\' before them like `\[` or `\]`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unresolved link to `0`
[INFO] [stdout]     --> src/digraph.rs:1627:5
[INFO] [stdout]      |
[INFO] [stdout] 1627 | /     /// Generate a dot file from the graph
[INFO] [stdout] 1628 | |     ///
[INFO] [stdout] 1629 | |     /// :param node_attr: A callable that will take in a node data object
[INFO] [stdout] 1630 | |     ///     and return a dictionary of attributes to be associated with the
[INFO] [stdout] ...    |
[INFO] [stdout] 1677 | |     ///   image
[INFO] [stdout] 1678 | |     ///
[INFO] [stdout]      | |_______^
[INFO] [stdout]      |
[INFO] [stdout]      = note: the link appears in this line:
[INFO] [stdout]              
[INFO] [stdout]                dot = pydot.graph_from_dot_data(dot_str)[0]
[INFO] [stdout]                                                         ^
[INFO] [stdout]      = note: no item named `0` in scope
[INFO] [stdout]      = help: to escape `[` and `]` characters, add '\' before them like `\[` or `\]`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unresolved link to `0`
[INFO] [stdout]     --> src/digraph.rs:1701:5
[INFO] [stdout]      |
[INFO] [stdout] 1701 | /     /// Read an edge list file and create a new PyDiGraph object from the
[INFO] [stdout] 1702 | |     /// contents
[INFO] [stdout] 1703 | |     ///
[INFO] [stdout] 1704 | |     /// The expected format for the edge list file is a line seperated list
[INFO] [stdout] ...    |
[INFO] [stdout] 1745 | |     ///   image
[INFO] [stdout] 1746 | |     ///
[INFO] [stdout]      | |_______^
[INFO] [stdout]      |
[INFO] [stdout]      = note: the link appears in this line:
[INFO] [stdout]              
[INFO] [stdout]                dot = pydot.graph_from_dot_data(graph.to_dot())[0]
[INFO] [stdout]                                                                ^
[INFO] [stdout]      = note: no item named `0` in scope
[INFO] [stdout]      = help: to escape `[` and `]` characters, add '\' before them like `\[` or `\]`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unresolved link to `0`
[INFO] [stdout]     --> src/digraph.rs:1863:5
[INFO] [stdout]      |
[INFO] [stdout] 1863 | /     /// Add another PyDiGraph object into this PyDiGraph
[INFO] [stdout] 1864 | |     ///
[INFO] [stdout] 1865 | |     /// :param PyDiGraph other: The other PyDiGraph object to add onto this
[INFO] [stdout] 1866 | |     ///     graph.
[INFO] [stdout] ...    |
[INFO] [stdout] 1957 | |     ///   image
[INFO] [stdout] 1958 | |     ///
[INFO] [stdout]      | |_______^
[INFO] [stdout]      |
[INFO] [stdout]      = note: the link appears in this line:
[INFO] [stdout]              
[INFO] [stdout]                dot = pydot.graph_from_dot_data(dot_str)[0]
[INFO] [stdout]                                                         ^
[INFO] [stdout]      = note: no item named `0` in scope
[INFO] [stdout]      = help: to escape `[` and `]` characters, add '\' before them like `\[` or `\]`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unresolved link to `0`
[INFO] [stdout]   --> src/generators.rs:35:1
[INFO] [stdout]    |
[INFO] [stdout] 35 | / /// Generate a cycle graph
[INFO] [stdout] 36 | | ///
[INFO] [stdout] 37 | | /// :param int num_node: The number of nodes to generate the graph with. Node
[INFO] [stdout] 38 | | ///     weights will be None if this is specified. If both ``num_node`` and
[INFO] [stdout] ...  |
[INFO] [stdout] 71 | | ///   image
[INFO] [stdout] 72 | | ///
[INFO] [stdout]    | |___^
[INFO] [stdout]    |
[INFO] [stdout]    = note: the link appears in this line:
[INFO] [stdout]            
[INFO] [stdout]              dot = pydot.graph_from_dot_data(dot_str)[0]
[INFO] [stdout]                                                       ^
[INFO] [stdout]    = note: no item named `0` in scope
[INFO] [stdout]    = help: to escape `[` and `]` characters, add '\' before them like `\[` or `\]`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unresolved link to `0`
[INFO] [stdout]    --> src/generators.rs:131:1
[INFO] [stdout]     |
[INFO] [stdout] 131 | / /// Generate an undirected cycle graph
[INFO] [stdout] 132 | | ///
[INFO] [stdout] 133 | | /// :param int num_node: The number of nodes to generate the graph with. Node
[INFO] [stdout] 134 | | ///     weights will be None if this is specified. If both ``num_node`` and
[INFO] [stdout] ...   |
[INFO] [stdout] 169 | | ///   image
[INFO] [stdout] 170 | | ///
[INFO] [stdout]     | |___^
[INFO] [stdout]     |
[INFO] [stdout]     = note: the link appears in this line:
[INFO] [stdout]             
[INFO] [stdout]               dot = pydot.graph_from_dot_data(dot_str)[0]
[INFO] [stdout]                                                        ^
[INFO] [stdout]     = note: no item named `0` in scope
[INFO] [stdout]     = help: to escape `[` and `]` characters, add '\' before them like `\[` or `\]`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unresolved link to `0`
[INFO] [stdout]    --> src/generators.rs:219:1
[INFO] [stdout]     |
[INFO] [stdout] 219 | / /// Generate a directed path graph
[INFO] [stdout] 220 | | ///
[INFO] [stdout] 221 | | /// :param int num_node: The number of nodes to generate the graph with. Node
[INFO] [stdout] 222 | | ///     weights will be None if this is specified. If both ``num_node`` and
[INFO] [stdout] ...   |
[INFO] [stdout] 255 | | ///   image
[INFO] [stdout] 256 | | ///
[INFO] [stdout]     | |___^
[INFO] [stdout]     |
[INFO] [stdout]     = note: the link appears in this line:
[INFO] [stdout]             
[INFO] [stdout]               dot = pydot.graph_from_dot_data(dot_str)[0]
[INFO] [stdout]                                                        ^
[INFO] [stdout]     = note: no item named `0` in scope
[INFO] [stdout]     = help: to escape `[` and `]` characters, add '\' before them like `\[` or `\]`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unresolved link to `0`
[INFO] [stdout]    --> src/generators.rs:306:1
[INFO] [stdout]     |
[INFO] [stdout] 306 | / /// Generate an undirected path graph
[INFO] [stdout] 307 | | ///
[INFO] [stdout] 308 | | /// :param int num_node: The number of nodes to generate the graph with. Node
[INFO] [stdout] 309 | | ///     weights will be None if this is specified. If both ``num_node`` and
[INFO] [stdout] ...   |
[INFO] [stdout] 344 | | ///   image
[INFO] [stdout] 345 | | ///
[INFO] [stdout]     | |___^
[INFO] [stdout]     |
[INFO] [stdout]     = note: the link appears in this line:
[INFO] [stdout]             
[INFO] [stdout]               dot = pydot.graph_from_dot_data(dot_str)[0]
[INFO] [stdout]                                                        ^
[INFO] [stdout]     = note: no item named `0` in scope
[INFO] [stdout]     = help: to escape `[` and `]` characters, add '\' before them like `\[` or `\]`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unresolved link to `0`
[INFO] [stdout]    --> src/generators.rs:386:1
[INFO] [stdout]     |
[INFO] [stdout] 386 | / /// Generate a directed star graph
[INFO] [stdout] 387 | | ///
[INFO] [stdout] 388 | | /// :param int num_node: The number of nodes to generate the graph with. Node
[INFO] [stdout] 389 | | ///     weights will be None if this is specified. If both ``num_node`` and
[INFO] [stdout] ...   |
[INFO] [stdout] 448 | | ///   image
[INFO] [stdout] 449 | | ///
[INFO] [stdout]     | |___^
[INFO] [stdout]     |
[INFO] [stdout]     = note: the link appears in this line:
[INFO] [stdout]             
[INFO] [stdout]               dot = pydot.graph_from_dot_data(dot_str)[0]
[INFO] [stdout]                                                        ^
[INFO] [stdout]     = note: no item named `0` in scope
[INFO] [stdout]     = help: to escape `[` and `]` characters, add '\' before them like `\[` or `\]`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unresolved link to `0`
[INFO] [stdout]    --> src/generators.rs:498:1
[INFO] [stdout]     |
[INFO] [stdout] 498 | / /// Generate an undirected star graph
[INFO] [stdout] 499 | | ///
[INFO] [stdout] 500 | | /// :param int num_node: The number of nodes to generate the graph with. Node
[INFO] [stdout] 501 | | ///     weights will be None if this is specified. If both ``num_node`` and
[INFO] [stdout] ...   |
[INFO] [stdout] 536 | | ///   image
[INFO] [stdout] 537 | | ///
[INFO] [stdout]     | |___^
[INFO] [stdout]     |
[INFO] [stdout]     = note: the link appears in this line:
[INFO] [stdout]             
[INFO] [stdout]               dot = pydot.graph_from_dot_data(dot_str)[0]
[INFO] [stdout]                                                        ^
[INFO] [stdout]     = note: no item named `0` in scope
[INFO] [stdout]     = help: to escape `[` and `]` characters, add '\' before them like `\[` or `\]`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unresolved link to `0`
[INFO] [stdout]    --> src/generators.rs:575:1
[INFO] [stdout]     |
[INFO] [stdout] 575 | / /// Generate an undirected mesh graph where every node is connected to every other
[INFO] [stdout] 576 | | ///
[INFO] [stdout] 577 | | /// :param int num_node: The number of nodes to generate the graph with. Node
[INFO] [stdout] 578 | | ///     weights will be None if this is specified. If both ``num_node`` and
[INFO] [stdout] ...   |
[INFO] [stdout] 612 | | ///   image
[INFO] [stdout] 613 | | ///
[INFO] [stdout]     | |___^
[INFO] [stdout]     |
[INFO] [stdout]     = note: the link appears in this line:
[INFO] [stdout]             
[INFO] [stdout]               dot = pydot.graph_from_dot_data(dot_str)[0]
[INFO] [stdout]                                                        ^
[INFO] [stdout]     = note: no item named `0` in scope
[INFO] [stdout]     = help: to escape `[` and `]` characters, add '\' before them like `\[` or `\]`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unresolved link to `0`
[INFO] [stdout]    --> src/generators.rs:655:1
[INFO] [stdout]     |
[INFO] [stdout] 655 | / /// Generate a directed mesh graph where every node is connected to every other
[INFO] [stdout] 656 | | ///
[INFO] [stdout] 657 | | /// :param int num_node: The number of nodes to generate the graph with. Node
[INFO] [stdout] 658 | | ///     weights will be None if this is specified. If both ``num_node`` and
[INFO] [stdout] ...   |
[INFO] [stdout] 688 | | ///   image
[INFO] [stdout] 689 | | ///
[INFO] [stdout]     | |___^
[INFO] [stdout]     |
[INFO] [stdout]     = note: the link appears in this line:
[INFO] [stdout]             
[INFO] [stdout]               dot = pydot.graph_from_dot_data(dot_str)[0]
[INFO] [stdout]                                                        ^
[INFO] [stdout]     = note: no item named `0` in scope
[INFO] [stdout]     = help: to escape `[` and `]` characters, add '\' before them like `\[` or `\]`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unresolved link to `0`
[INFO] [stdout]    --> src/generators.rs:732:1
[INFO] [stdout]     |
[INFO] [stdout] 732 | / /// Generate an undirected grid graph.
[INFO] [stdout] 733 | | ///
[INFO] [stdout] 734 | | /// :param int rows: The number of rows to generate the graph with.
[INFO] [stdout] 735 | | ///     If specified, cols also need to be specified
[INFO] [stdout] ...   |
[INFO] [stdout] 777 | | ///   image
[INFO] [stdout] 778 | | ///
[INFO] [stdout]     | |___^
[INFO] [stdout]     |
[INFO] [stdout]     = note: the link appears in this line:
[INFO] [stdout]             
[INFO] [stdout]               dot = pydot.graph_from_dot_data(dot_str)[0]
[INFO] [stdout]                                                        ^
[INFO] [stdout]     = note: no item named `0` in scope
[INFO] [stdout]     = help: to escape `[` and `]` characters, add '\' before them like `\[` or `\]`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unresolved link to `0`
[INFO] [stdout]    --> src/generators.rs:852:1
[INFO] [stdout]     |
[INFO] [stdout] 852 | / /// Generate a directed grid graph. The edges propagate towards right and
[INFO] [stdout] 853 | | ///     bottom direction if ``bidirectional`` is ``false``
[INFO] [stdout] 854 | | ///
[INFO] [stdout] 855 | | /// :param int rows: The number of rows to generate the graph with.
[INFO] [stdout] ...   |
[INFO] [stdout] 896 | | ///   image
[INFO] [stdout] 897 | | ///
[INFO] [stdout]     | |___^
[INFO] [stdout]     |
[INFO] [stdout]     = note: the link appears in this line:
[INFO] [stdout]             
[INFO] [stdout]               dot = pydot.graph_from_dot_data(dot_str)[0]
[INFO] [stdout]                                                        ^
[INFO] [stdout]     = note: no item named `0` in scope
[INFO] [stdout]     = help: to escape `[` and `]` characters, add '\' before them like `\[` or `\]`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unresolved link to `0`
[INFO] [stdout]     --> src/graph.rs:980:5
[INFO] [stdout]      |
[INFO] [stdout] 980  | /     /// Generate a dot file from the graph
[INFO] [stdout] 981  | |     ///
[INFO] [stdout] 982  | |     /// :param node_attr: A callable that will take in a node data object
[INFO] [stdout] 983  | |     ///     and return a dictionary of attributes to be associated with the
[INFO] [stdout] ...    |
[INFO] [stdout] 1030 | |     ///   image
[INFO] [stdout] 1031 | |     ///
[INFO] [stdout]      | |_______^
[INFO] [stdout]      |
[INFO] [stdout]      = note: the link appears in this line:
[INFO] [stdout]              
[INFO] [stdout]                dot = pydot.graph_from_dot_data(dot_str)[0]
[INFO] [stdout]                                                         ^
[INFO] [stdout]      = note: no item named `0` in scope
[INFO] [stdout]      = help: to escape `[` and `]` characters, add '\' before them like `\[` or `\]`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unresolved link to `0`
[INFO] [stdout]     --> src/graph.rs:1054:5
[INFO] [stdout]      |
[INFO] [stdout] 1054 | /     /// Read an edge list file and create a new PyGraph object from the
[INFO] [stdout] 1055 | |     /// contents
[INFO] [stdout] 1056 | |     ///
[INFO] [stdout] 1057 | |     /// The expected format for the edge list file is a line seperated list
[INFO] [stdout] ...    |
[INFO] [stdout] 1098 | |     ///   image
[INFO] [stdout] 1099 | |     ///
[INFO] [stdout]      | |_______^
[INFO] [stdout]      |
[INFO] [stdout]      = note: the link appears in this line:
[INFO] [stdout]              
[INFO] [stdout]                dot = pydot.graph_from_dot_data(graph.to_dot())[0]
[INFO] [stdout]                                                                ^
[INFO] [stdout]      = note: no item named `0` in scope
[INFO] [stdout]      = help: to escape `[` and `]` characters, add '\' before them like `\[` or `\]`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unresolved link to `0`
[INFO] [stdout]     --> src/graph.rs:1213:5
[INFO] [stdout]      |
[INFO] [stdout] 1213 | /     /// Add another PyGraph object into this PyGraph
[INFO] [stdout] 1214 | |     ///
[INFO] [stdout] 1215 | |     /// :param PyGraph other: The other PyGraph object to add onto this
[INFO] [stdout] 1216 | |     ///     graph.
[INFO] [stdout] ...    |
[INFO] [stdout] 1306 | |     ///   image
[INFO] [stdout] 1307 | |     ///
[INFO] [stdout]      | |_______^
[INFO] [stdout]      |
[INFO] [stdout]      = note: the link appears in this line:
[INFO] [stdout]              
[INFO] [stdout]                dot = pydot.graph_from_dot_data(dot_str)[0]
[INFO] [stdout]                                                         ^
[INFO] [stdout]      = note: no item named `0` in scope
[INFO] [stdout]      = help: to escape `[` and `]` characters, add '\' before them like `\[` or `\]`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unresolved link to `Graph`
[INFO] [stdout]   --> src/union.rs:21:6
[INFO] [stdout]    |
[INFO] [stdout] 21 | /// [Graph] Return a new PyDiGraph by forming a union from`a` and `b` graphs.
[INFO] [stdout]    |      ^^^^^ no item named `Graph` in scope
[INFO] [stdout]    |
[INFO] [stdout]    = help: to escape `[` and `]` characters, add '\' before them like `\[` or `\]`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unresolved link to `1`
[INFO] [stdout]     --> src/lib.rs:2050:1
[INFO] [stdout]      |
[INFO] [stdout] 2050 | / /// Return a :math:`G_{np}` directed random graph, also known as an
[INFO] [stdout] 2051 | | /// Erdős-Rényi graph or a binomial graph.
[INFO] [stdout] 2052 | | ///
[INFO] [stdout] 2053 | | /// For number of nodes :math:`n` and probability :math:`p`, the :math:`G_{n,p}`
[INFO] [stdout] ...    |
[INFO] [stdout] 2077 | | ///    Phys. Rev. E, 71, 036113, 2005.
[INFO] [stdout] 2078 | | /// .. [2] https://github.com/networkx/networkx/blob/networkx-2.4/networkx/generators/random_graphs.py#L49-L120
[INFO] [stdout]      | |_______________________________________________________________________________________________________________^
[INFO] [stdout]      |
[INFO] [stdout]      = note: the link appears in this line:
[INFO] [stdout]              
[INFO] [stdout]              For other probabilities, this algorithm [1]_ runs in :math:`O(n + m)` time.
[INFO] [stdout]                                                       ^
[INFO] [stdout]      = note: no item named `1` in scope
[INFO] [stdout]      = help: to escape `[` and `]` characters, add '\' before them like `\[` or `\]`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unresolved link to `2`
[INFO] [stdout]     --> src/lib.rs:2050:1
[INFO] [stdout]      |
[INFO] [stdout] 2050 | / /// Return a :math:`G_{np}` directed random graph, also known as an
[INFO] [stdout] 2051 | | /// Erdős-Rényi graph or a binomial graph.
[INFO] [stdout] 2052 | | ///
[INFO] [stdout] 2053 | | /// For number of nodes :math:`n` and probability :math:`p`, the :math:`G_{n,p}`
[INFO] [stdout] ...    |
[INFO] [stdout] 2077 | | ///    Phys. Rev. E, 71, 036113, 2005.
[INFO] [stdout] 2078 | | /// .. [2] https://github.com/networkx/networkx/blob/networkx-2.4/networkx/generators/random_graphs.py#L49-L120
[INFO] [stdout]      | |_______________________________________________________________________________________________________________^
[INFO] [stdout]      |
[INFO] [stdout]      = note: the link appears in this line:
[INFO] [stdout]              
[INFO] [stdout]              ``fast_gnp_random_graph`` [2]_
[INFO] [stdout]                                         ^
[INFO] [stdout]      = note: no item named `2` in scope
[INFO] [stdout]      = help: to escape `[` and `]` characters, add '\' before them like `\[` or `\]`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unresolved link to `1`
[INFO] [stdout]     --> src/lib.rs:2158:1
[INFO] [stdout]      |
[INFO] [stdout] 2158 | / /// Return a :math:`G_{np}` random undirected graph, also known as an
[INFO] [stdout] 2159 | | /// Erdős-Rényi graph or a binomial graph.
[INFO] [stdout] 2160 | | ///
[INFO] [stdout] 2161 | | /// For number of nodes :math:`n` and probability :math:`p`, the :math:`G_{n,p}`
[INFO] [stdout] ...    |
[INFO] [stdout] 2185 | | ///    Phys. Rev. E, 71, 036113, 2005.
[INFO] [stdout] 2186 | | /// .. [2] https://github.com/networkx/networkx/blob/networkx-2.4/networkx/generators/random_graphs.py#L49-L120
[INFO] [stdout]      | |_______________________________________________________________________________________________________________^
[INFO] [stdout]      |
[INFO] [stdout]      = note: the link appears in this line:
[INFO] [stdout]              
[INFO] [stdout]              For other probabilities, this algorithm [1]_ runs in :math:`O(n + m)` time.
[INFO] [stdout]                                                       ^
[INFO] [stdout]      = note: no item named `1` in scope
[INFO] [stdout]      = help: to escape `[` and `]` characters, add '\' before them like `\[` or `\]`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unresolved link to `2`
[INFO] [stdout]     --> src/lib.rs:2158:1
[INFO] [stdout]      |
[INFO] [stdout] 2158 | / /// Return a :math:`G_{np}` random undirected graph, also known as an
[INFO] [stdout] 2159 | | /// Erdős-Rényi graph or a binomial graph.
[INFO] [stdout] 2160 | | ///
[INFO] [stdout] 2161 | | /// For number of nodes :math:`n` and probability :math:`p`, the :math:`G_{n,p}`
[INFO] [stdout] ...    |
[INFO] [stdout] 2185 | | ///    Phys. Rev. E, 71, 036113, 2005.
[INFO] [stdout] 2186 | | /// .. [2] https://github.com/networkx/networkx/blob/networkx-2.4/networkx/generators/random_graphs.py#L49-L120
[INFO] [stdout]      | |_______________________________________________________________________________________________________________^
[INFO] [stdout]      |
[INFO] [stdout]      = note: the link appears in this line:
[INFO] [stdout]              
[INFO] [stdout]              ``fast_gnp_random_graph`` [2]_
[INFO] [stdout]                                         ^
[INFO] [stdout]      = note: no item named `2` in scope
[INFO] [stdout]      = help: to escape `[` and `]` characters, add '\' before them like `\[` or `\]`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unresolved link to `1`
[INFO] [stdout]     --> src/lib.rs:2407:1
[INFO] [stdout]      |
[INFO] [stdout] 2407 | / /// Return a list of cycles which form a basis for cycles of a given PyGraph
[INFO] [stdout] 2408 | | ///
[INFO] [stdout] 2409 | | /// A basis for cycles of a graph is a minimal collection of
[INFO] [stdout] 2410 | | /// cycles such that any cycle in the graph can be written
[INFO] [stdout] ...    |
[INFO] [stdout] 2423 | | /// .. [1] Paton, K. An algorithm for finding a fundamental set of
[INFO] [stdout] 2424 | | ///    cycles of a graph. Comm. ACM 12, 9 (Sept 1969), 514-518.
[INFO] [stdout]      | |_______________________________________________________________^
[INFO] [stdout]      |
[INFO] [stdout]      = note: the link appears in this line:
[INFO] [stdout]              
[INFO] [stdout]              This is adapted from algorithm CACM 491 [1]_.
[INFO] [stdout]                                                       ^
[INFO] [stdout]      = note: no item named `1` in scope
[INFO] [stdout]      = help: to escape `[` and `]` characters, add '\' before them like `\[` or `\]`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unresolved link to `1`
[INFO] [stdout]     --> src/lib.rs:2497:1
[INFO] [stdout]      |
[INFO] [stdout] 2497 | / /// Compute a maximum-weighted matching for a :class:`~retworkx.PyGraph`
[INFO] [stdout] 2498 | | ///
[INFO] [stdout] 2499 | | /// A matching is a subset of edges in which no node occurs more than once.
[INFO] [stdout] 2500 | | /// The weight of a matching is the sum of the weights of its edges.
[INFO] [stdout] ...    |
[INFO] [stdout] 2535 | | ///     Zvi Galil, ACM Computing Surveys, 1986.
[INFO] [stdout] 2536 | | ///
[INFO] [stdout]      | |___^
[INFO] [stdout]      |
[INFO] [stdout]      = note: the link appears in this line:
[INFO] [stdout]              
[INFO] [stdout]              weight, both methods invented by Jack Edmonds [1]_.
[INFO] [stdout]                                                             ^
[INFO] [stdout]      = note: no item named `1` in scope
[INFO] [stdout]      = help: to escape `[` and `]` characters, add '\' before them like `\[` or `\]`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: could not parse code block as Rust code
[INFO] [stdout]    --> src/digraph.rs:801:5
[INFO] [stdout]     |
[INFO] [stdout] 801 | /     /// Remove a node from the graph and add edges from all predecessors to all
[INFO] [stdout] 802 | |     /// successors
[INFO] [stdout] 803 | |     ///
[INFO] [stdout] 804 | |     /// By default the data/weight on edges into the removed node will be used
[INFO] [stdout] ...   |
[INFO] [stdout] 820 | |     ///     would only retain edges if the input edge to ``node`` had the same
[INFO] [stdout] 821 | |     ///     data payload as the outgoing edge.
[INFO] [stdout]     | |______________________________________________^
[INFO] [stdout]     |
[INFO] [stdout]     = note: error from rustc: unknown start of token: `
[INFO] [stdout]     = note: error from rustc: unknown start of token: `
[INFO] [stdout]     = note: `#[warn(rustdoc::invalid_rust_codeblocks)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: this URL is not a hyperlink
[INFO] [stdout]    --> src/max_weight_matching.rs:861:5
[INFO] [stdout]     |
[INFO] [stdout] 861 | /// https://github.com/networkx/networkx/blob/3351206a3ce5b3a39bb2fc451e93ef545b96c95b/networkx/algorithms/matching.py
[INFO] [stdout]     |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ help: use an automatic link instead: `<https://github.com/networkx/networkx/blob/3351206a3ce5b3a39bb2fc451e93ef545b96c95b/networkx/algorithms/matching.py>`
[INFO] [stdout]     |
[INFO] [stdout]     = note: bare URLs are not automatically turned into clickable links
[INFO] [stdout]     = note: `#[warn(rustdoc::bare_urls)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: this URL is not a hyperlink
[INFO] [stdout]    --> src/max_weight_matching.rs:864:5
[INFO] [stdout]     |
[INFO] [stdout] 864 | /// http://jorisvr.nl/article/maximum-matching
[INFO] [stdout]     |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ help: use an automatic link instead: `<http://jorisvr.nl/article/maximum-matching>`
[INFO] [stdout]     |
[INFO] [stdout]     = note: bare URLs are not automatically turned into clickable links
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: this URL is not a hyperlink
[INFO] [stdout]    --> src/max_weight_matching.rs:866:5
[INFO] [stdout]     |
[INFO] [stdout] 866 | /// http://jorisvr.nl/files/graphmatching/20130407/mwmatching.py
[INFO] [stdout]     |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ help: use an automatic link instead: `<http://jorisvr.nl/files/graphmatching/20130407/mwmatching.py>`
[INFO] [stdout]     |
[INFO] [stdout]     = note: bare URLs are not automatically turned into clickable links
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: could not parse code block as Rust code
[INFO] [stdout]     --> src/lib.rs:1423:1
[INFO] [stdout]      |
[INFO] [stdout] 1423 | / /// Return the adjacency matrix for a PyDiGraph object
[INFO] [stdout] 1424 | | ///
[INFO] [stdout] 1425 | | /// In the case where there are multiple edges between nodes the value in the
[INFO] [stdout] 1426 | | /// output matrix will be the sum of the edges' weights.
[INFO] [stdout] ...    |
[INFO] [stdout] 1447 | | ///  :return: The adjacency matrix for the input dag as a numpy array
[INFO] [stdout] 1448 | | ///  :rtype: numpy.ndarray
[INFO] [stdout]      | |__________________________^
[INFO] [stdout]      |
[INFO] [stdout]      = note: error from rustc: unknown start of token: `
[INFO] [stdout]      = note: error from rustc: unknown start of token: `
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: could not parse code block as Rust code
[INFO] [stdout]     --> src/lib.rs:1467:1
[INFO] [stdout]      |
[INFO] [stdout] 1467 | / /// Return the adjacency matrix for a PyGraph class
[INFO] [stdout] 1468 | | ///
[INFO] [stdout] 1469 | | /// In the case where there are multiple edges between nodes the value in the
[INFO] [stdout] 1470 | | /// output matrix will be the sum of the edges' weights.
[INFO] [stdout] ...    |
[INFO] [stdout] 1490 | | /// :return: The adjacency matrix for the input dag as a numpy array
[INFO] [stdout] 1491 | | /// :rtype: numpy.ndarray
[INFO] [stdout]      | |_________________________^
[INFO] [stdout]      |
[INFO] [stdout]      = note: error from rustc: unknown start of token: `
[INFO] [stdout]      = note: error from rustc: unknown start of token: `
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: this URL is not a hyperlink
[INFO] [stdout]     --> src/lib.rs:2050:1
[INFO] [stdout]      |
[INFO] [stdout] 2050 | / /// Return a :math:`G_{np}` directed random graph, also known as an
[INFO] [stdout] 2051 | | /// Erdős-Rényi graph or a binomial graph.
[INFO] [stdout] 2052 | | ///
[INFO] [stdout] 2053 | | /// For number of nodes :math:`n` and probability :math:`p`, the :math:`G_{n,p}`
[INFO] [stdout] ...    |
[INFO] [stdout] 2077 | | ///    Phys. Rev. E, 71, 036113, 2005.
[INFO] [stdout] 2078 | | /// .. [2] https://github.com/networkx/networkx/blob/networkx-2.4/networkx/generators/random_graphs.py#L49-L120
[INFO] [stdout]      | |_______________________________________________________________________________________________________________^ help: use an automatic link instead: `<https://github.com/networkx/networkx/blob/networkx-2.4/networkx/generators/random_graphs.py#L49-L120>`
[INFO] [stdout]      |
[INFO] [stdout]      = note: bare URLs are not automatically turned into clickable links
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: this URL is not a hyperlink
[INFO] [stdout]     --> src/lib.rs:2158:1
[INFO] [stdout]      |
[INFO] [stdout] 2158 | / /// Return a :math:`G_{np}` random undirected graph, also known as an
[INFO] [stdout] 2159 | | /// Erdős-Rényi graph or a binomial graph.
[INFO] [stdout] 2160 | | ///
[INFO] [stdout] 2161 | | /// For number of nodes :math:`n` and probability :math:`p`, the :math:`G_{n,p}`
[INFO] [stdout] ...    |
[INFO] [stdout] 2185 | | ///    Phys. Rev. E, 71, 036113, 2005.
[INFO] [stdout] 2186 | | /// .. [2] https://github.com/networkx/networkx/blob/networkx-2.4/networkx/generators/random_graphs.py#L49-L120
[INFO] [stdout]      | |_______________________________________________________________________________________________________________^ help: use an automatic link instead: `<https://github.com/networkx/networkx/blob/networkx-2.4/networkx/generators/random_graphs.py#L49-L120>`
[INFO] [stdout]      |
[INFO] [stdout]      = note: bare URLs are not automatically turned into clickable links
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 35 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr]     Finished dev [unoptimized + debuginfo] target(s) in 9.99s
[INFO] [stderr] warning: the following packages contain code that will be rejected by a future version of Rust: pyo3 v0.12.4, pyo3-derive-backend v0.12.4
[INFO] [stderr] note: to see what the problems were, use the option `--future-incompat-report`, or run `cargo report future-incompatibilities --id 1`
[INFO] running `Command { std: "docker" "inspect" "125fe88f83ba639818534763ee2fc9164ca11e22c1f5d2e13569ae7d567eaea0", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "125fe88f83ba639818534763ee2fc9164ca11e22c1f5d2e13569ae7d567eaea0", kill_on_drop: false }`
[INFO] [stdout] 125fe88f83ba639818534763ee2fc9164ca11e22c1f5d2e13569ae7d567eaea0
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-3-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-3-tc1/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_INCREMENTAL=0" "-e" "RUST_BACKTRACE=full" "-e" "RUSTFLAGS=--cap-lints=warn" "-e" "RUSTDOCFLAGS=--cap-lints=warn" "-e" "DOCS_RS=1" "-e" "RUSTC_BOOTSTRAP=1" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:5ff2268d62e97bff2cde7d5815dd6ed5b47097566f13b8d0ca110b04b60e07ed" "/opt/rustwide/cargo-home/bin/cargo" "+1.69.0" "rustdoc" "--lib" "-Zrustdoc-map" "-Z" "unstable-options" "--config" "build.rustdocflags=[\"-Z\", \"unstable-options\", \"--document-private-items\"]" "--frozen" "--message-format=json", kill_on_drop: false }`
[INFO] [stdout] 535eef63abf643a118a960908e148e659e6475770d26c63be9f13a0d3b51f2ee
[INFO] running `Command { std: "docker" "start" "-a" "535eef63abf643a118a960908e148e659e6475770d26c63be9f13a0d3b51f2ee", kill_on_drop: false }`
[INFO] [stderr]  Documenting retworkx v0.8.0 (/opt/rustwide/workdir)
[INFO] [stdout] warning: unresolved link to `1`
[INFO] [stdout]     --> src/lib.rs:2050:1
[INFO] [stdout]      |
[INFO] [stdout] 2050 | / /// Return a :math:`G_{np}` directed random graph, also known as an
[INFO] [stdout] 2051 | | /// Erdős-Rényi graph or a binomial graph.
[INFO] [stdout] 2052 | | ///
[INFO] [stdout] 2053 | | /// For number of nodes :math:`n` and probability :math:`p`, the :math:`G_{n,p}`
[INFO] [stdout] ...    |
[INFO] [stdout] 2077 | | ///    Phys. Rev. E, 71, 036113, 2005.
[INFO] [stdout] 2078 | | /// .. [2] https://github.com/networkx/networkx/blob/networkx-2.4/networkx/generators/random_graphs.py#L49-L120
[INFO] [stdout]      | |_______________________________________________________________________________________________________________^
[INFO] [stdout]      |
[INFO] [stdout]      = note: the link appears in this line:
[INFO] [stdout]              
[INFO] [stdout]              For other probabilities, this algorithm [1]_ runs in :math:`O(n + m)` time.
[INFO] [stdout]                                                       ^
[INFO] [stdout]      = note: no item named `1` in scope
[INFO] [stdout]      = help: to escape `[` and `]` characters, add '\' before them like `\[` or `\]`
[INFO] [stdout]      = note: `#[warn(rustdoc::broken_intra_doc_links)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unresolved link to `2`
[INFO] [stdout]     --> src/lib.rs:2050:1
[INFO] [stdout]      |
[INFO] [stdout] 2050 | / /// Return a :math:`G_{np}` directed random graph, also known as an
[INFO] [stdout] 2051 | | /// Erdős-Rényi graph or a binomial graph.
[INFO] [stdout] 2052 | | ///
[INFO] [stdout] 2053 | | /// For number of nodes :math:`n` and probability :math:`p`, the :math:`G_{n,p}`
[INFO] [stdout] ...    |
[INFO] [stdout] 2077 | | ///    Phys. Rev. E, 71, 036113, 2005.
[INFO] [stdout] 2078 | | /// .. [2] https://github.com/networkx/networkx/blob/networkx-2.4/networkx/generators/random_graphs.py#L49-L120
[INFO] [stdout]      | |_______________________________________________________________________________________________________________^
[INFO] [stdout]      |
[INFO] [stdout]      = note: the link appears in this line:
[INFO] [stdout]              
[INFO] [stdout]              ``fast_gnp_random_graph`` [2]_
[INFO] [stdout]                                         ^
[INFO] [stdout]      = note: no item named `2` in scope
[INFO] [stdout]      = help: to escape `[` and `]` characters, add '\' before them like `\[` or `\]`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unresolved link to `1`
[INFO] [stdout]     --> src/lib.rs:2158:1
[INFO] [stdout]      |
[INFO] [stdout] 2158 | / /// Return a :math:`G_{np}` random undirected graph, also known as an
[INFO] [stdout] 2159 | | /// Erdős-Rényi graph or a binomial graph.
[INFO] [stdout] 2160 | | ///
[INFO] [stdout] 2161 | | /// For number of nodes :math:`n` and probability :math:`p`, the :math:`G_{n,p}`
[INFO] [stdout] ...    |
[INFO] [stdout] 2185 | | ///    Phys. Rev. E, 71, 036113, 2005.
[INFO] [stdout] 2186 | | /// .. [2] https://github.com/networkx/networkx/blob/networkx-2.4/networkx/generators/random_graphs.py#L49-L120
[INFO] [stdout]      | |_______________________________________________________________________________________________________________^
[INFO] [stdout]      |
[INFO] [stdout]      = note: the link appears in this line:
[INFO] [stdout]              
[INFO] [stdout]              For other probabilities, this algorithm [1]_ runs in :math:`O(n + m)` time.
[INFO] [stdout]                                                       ^
[INFO] [stdout]      = note: no item named `1` in scope
[INFO] [stdout]      = help: to escape `[` and `]` characters, add '\' before them like `\[` or `\]`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unresolved link to `2`
[INFO] [stdout]     --> src/lib.rs:2158:1
[INFO] [stdout]      |
[INFO] [stdout] 2158 | / /// Return a :math:`G_{np}` random undirected graph, also known as an
[INFO] [stdout] 2159 | | /// Erdős-Rényi graph or a binomial graph.
[INFO] [stdout] 2160 | | ///
[INFO] [stdout] 2161 | | /// For number of nodes :math:`n` and probability :math:`p`, the :math:`G_{n,p}`
[INFO] [stdout] ...    |
[INFO] [stdout] 2185 | | ///    Phys. Rev. E, 71, 036113, 2005.
[INFO] [stdout] 2186 | | /// .. [2] https://github.com/networkx/networkx/blob/networkx-2.4/networkx/generators/random_graphs.py#L49-L120
[INFO] [stdout]      | |_______________________________________________________________________________________________________________^
[INFO] [stdout]      |
[INFO] [stdout]      = note: the link appears in this line:
[INFO] [stdout]              
[INFO] [stdout]              ``fast_gnp_random_graph`` [2]_
[INFO] [stdout]                                         ^
[INFO] [stdout]      = note: no item named `2` in scope
[INFO] [stdout]      = help: to escape `[` and `]` characters, add '\' before them like `\[` or `\]`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unresolved link to `1`
[INFO] [stdout]     --> src/lib.rs:2407:1
[INFO] [stdout]      |
[INFO] [stdout] 2407 | / /// Return a list of cycles which form a basis for cycles of a given PyGraph
[INFO] [stdout] 2408 | | ///
[INFO] [stdout] 2409 | | /// A basis for cycles of a graph is a minimal collection of
[INFO] [stdout] 2410 | | /// cycles such that any cycle in the graph can be written
[INFO] [stdout] ...    |
[INFO] [stdout] 2423 | | /// .. [1] Paton, K. An algorithm for finding a fundamental set of
[INFO] [stdout] 2424 | | ///    cycles of a graph. Comm. ACM 12, 9 (Sept 1969), 514-518.
[INFO] [stdout]      | |_______________________________________________________________^
[INFO] [stdout]      |
[INFO] [stdout]      = note: the link appears in this line:
[INFO] [stdout]              
[INFO] [stdout]              This is adapted from algorithm CACM 491 [1]_.
[INFO] [stdout]                                                       ^
[INFO] [stdout]      = note: no item named `1` in scope
[INFO] [stdout]      = help: to escape `[` and `]` characters, add '\' before them like `\[` or `\]`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unresolved link to `1`
[INFO] [stdout]     --> src/lib.rs:2497:1
[INFO] [stdout]      |
[INFO] [stdout] 2497 | / /// Compute a maximum-weighted matching for a :class:`~retworkx.PyGraph`
[INFO] [stdout] 2498 | | ///
[INFO] [stdout] 2499 | | /// A matching is a subset of edges in which no node occurs more than once.
[INFO] [stdout] 2500 | | /// The weight of a matching is the sum of the weights of its edges.
[INFO] [stdout] ...    |
[INFO] [stdout] 2535 | | ///     Zvi Galil, ACM Computing Surveys, 1986.
[INFO] [stdout] 2536 | | ///
[INFO] [stdout]      | |___^
[INFO] [stdout]      |
[INFO] [stdout]      = note: the link appears in this line:
[INFO] [stdout]              
[INFO] [stdout]              weight, both methods invented by Jack Edmonds [1]_.
[INFO] [stdout]                                                             ^
[INFO] [stdout]      = note: no item named `1` in scope
[INFO] [stdout]      = help: to escape `[` and `]` characters, add '\' before them like `\[` or `\]`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: this URL is not a hyperlink
[INFO] [stdout]     --> src/lib.rs:2050:1
[INFO] [stdout]      |
[INFO] [stdout] 2050 | / /// Return a :math:`G_{np}` directed random graph, also known as an
[INFO] [stdout] 2051 | | /// Erdős-Rényi graph or a binomial graph.
[INFO] [stdout] 2052 | | ///
[INFO] [stdout] 2053 | | /// For number of nodes :math:`n` and probability :math:`p`, the :math:`G_{n,p}`
[INFO] [stdout] ...    |
[INFO] [stdout] 2077 | | ///    Phys. Rev. E, 71, 036113, 2005.
[INFO] [stdout] 2078 | | /// .. [2] https://github.com/networkx/networkx/blob/networkx-2.4/networkx/generators/random_graphs.py#L49-L120
[INFO] [stdout]      | |_______________________________________________________________________________________________________________^ help: use an automatic link instead: `<https://github.com/networkx/networkx/blob/networkx-2.4/networkx/generators/random_graphs.py#L49-L120>`
[INFO] [stdout]      |
[INFO] [stdout]      = note: bare URLs are not automatically turned into clickable links
[INFO] [stdout]      = note: `#[warn(rustdoc::bare_urls)]` on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: this URL is not a hyperlink
[INFO] [stdout]     --> src/lib.rs:2158:1
[INFO] [stdout]      |
[INFO] [stdout] 2158 | / /// Return a :math:`G_{np}` random undirected graph, also known as an
[INFO] [stdout] 2159 | | /// Erdős-Rényi graph or a binomial graph.
[INFO] [stdout] 2160 | | ///
[INFO] [stdout] 2161 | | /// For number of nodes :math:`n` and probability :math:`p`, the :math:`G_{n,p}`
[INFO] [stdout] ...    |
[INFO] [stdout] 2185 | | ///    Phys. Rev. E, 71, 036113, 2005.
[INFO] [stdout] 2186 | | /// .. [2] https://github.com/networkx/networkx/blob/networkx-2.4/networkx/generators/random_graphs.py#L49-L120
[INFO] [stdout]      | |_______________________________________________________________________________________________________________^ help: use an automatic link instead: `<https://github.com/networkx/networkx/blob/networkx-2.4/networkx/generators/random_graphs.py#L49-L120>`
[INFO] [stdout]      |
[INFO] [stdout]      = note: bare URLs are not automatically turned into clickable links
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: 8 warnings emitted
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr]     Finished dev [unoptimized + debuginfo] target(s) in 1.30s
[INFO] [stderr] warning: the following packages contain code that will be rejected by a future version of Rust: pyo3 v0.12.4, pyo3-derive-backend v0.12.4
[INFO] [stderr] note: to see what the problems were, use the option `--future-incompat-report`, or run `cargo report future-incompatibilities --id 1`
[INFO] running `Command { std: "docker" "inspect" "535eef63abf643a118a960908e148e659e6475770d26c63be9f13a0d3b51f2ee", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "535eef63abf643a118a960908e148e659e6475770d26c63be9f13a0d3b51f2ee", kill_on_drop: false }`
[INFO] [stdout] 535eef63abf643a118a960908e148e659e6475770d26c63be9f13a0d3b51f2ee
