[INFO] fetching crate dagre 0.1.1...
[INFO] testing dagre-0.1.1 against 1.100.0-beta.1+cargoflags=--release for beta-release-1.100-2
[INFO] extracting crate dagre 0.1.1 into /workspace/builds/worker-0-tc2/source
[INFO] started tweaking crates.io crate dagre 0.1.1
[INFO] removed 0 missing tests
[INFO] finished tweaking crates.io crate dagre 0.1.1
[INFO] tweaked toml for crates.io crate dagre 0.1.1 written to /workspace/builds/worker-0-tc2/source/Cargo.toml
[INFO] validating manifest of crates.io crate dagre 0.1.1 on toolchain 1.100.0-beta.1
[INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+1.100.0-beta.1" "metadata" "--manifest-path" "Cargo.toml" "--no-deps", kill_on_drop: false }`
[INFO] crate crates.io crate dagre 0.1.1 already has a lockfile, it will not be regenerated
[INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+1.100.0-beta.1" "fetch" "--manifest-path" "Cargo.toml", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-0-tc2/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-0-tc2/target:/opt/rustwide/target:rw,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" "-m" "1610612736" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:77db811e55d90add9212f6832c23229e3de5f1c1f9905e8cb07319ea15df73ac" "sleep" "infinity", kill_on_drop: false }`
[INFO] [stdout] bc89d7ced1fc2955cbe44c5f309ed7b3a9c2681a936e09851100f19beee49dc6
[INFO] running `Command { std: "docker" "start" "bc89d7ced1fc2955cbe44c5f309ed7b3a9c2681a936e09851100f19beee49dc6", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "inspect" "bc89d7ced1fc2955cbe44c5f309ed7b3a9c2681a936e09851100f19beee49dc6", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "exec" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-w" "/opt/rustwide/workdir" "--user" "0:0" "bc89d7ced1fc2955cbe44c5f309ed7b3a9c2681a936e09851100f19beee49dc6" "/opt/rustwide/cargo-home/bin/cargo" "+1.100.0-beta.1" "metadata" "--no-deps" "--format-version=1", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "inspect" "bc89d7ced1fc2955cbe44c5f309ed7b3a9c2681a936e09851100f19beee49dc6", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "exec" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-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" "-w" "/opt/rustwide/workdir" "--user" "0:0" "bc89d7ced1fc2955cbe44c5f309ed7b3a9c2681a936e09851100f19beee49dc6" "/opt/rustwide/cargo-home/bin/cargo" "+1.100.0-beta.1" "build" "--frozen" "--message-format=json" "--release", kill_on_drop: false }`
[INFO] [stderr]    Compiling quote v1.0.45
[INFO] [stderr]    Compiling syn v2.0.117
[INFO] [stderr]    Compiling serde_derive v1.0.228
[INFO] [stderr]    Compiling serde v1.0.228
[INFO] [stderr]    Compiling dagre v0.1.1 (/opt/rustwide/workdir)
[INFO] [stderr] warning: unused dependency `serde_json`
[INFO] [stderr]  --> Cargo.toml:9:15
[INFO] [stderr]   |
[INFO] [stderr] 9 | [dependencies.serde_json]
[INFO] [stderr]   |               ^^^^^^^^^^^
[INFO] [stderr]   |
[INFO] [stderr]   = note: `cargo::unused_dependencies` is set to `warn` by default
[INFO] [stderr] help: consider removing the dependency on `serde_json`
[INFO] [stderr] warning: `dagre` (manifest) generated 1 warning
[INFO] [stderr]     Finished `release` profile [optimized] target(s) in 15.31s
[INFO] running `Command { std: "docker" "inspect" "bc89d7ced1fc2955cbe44c5f309ed7b3a9c2681a936e09851100f19beee49dc6", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "exec" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-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" "-w" "/opt/rustwide/workdir" "--user" "0:0" "bc89d7ced1fc2955cbe44c5f309ed7b3a9c2681a936e09851100f19beee49dc6" "/opt/rustwide/cargo-home/bin/cargo" "+1.100.0-beta.1" "test" "--frozen" "--no-run" "--message-format=json" "--release", kill_on_drop: false }`
[INFO] [stderr]    Compiling dagre v0.1.1 (/opt/rustwide/workdir)
[INFO] [stderr] warning: unused dependency `serde_json`
[INFO] [stderr]   --> Cargo.toml:17:19
[INFO] [stderr]    |
[INFO] [stderr] 17 | [dev-dependencies.serde_json]
[INFO] [stderr]    |                   ^^^^^^^^^^^
[INFO] [stderr]    |
[INFO] [stderr]    = note: `cargo::unused_dependencies` is set to `warn` by default
[INFO] [stderr] help: consider removing the dependency on `serde_json`
[INFO] [stderr] help: to still use for development builds, move to `dev-dependencies`
[INFO] [stderr] warning: unused dependency `serde_json`
[INFO] [stderr]  --> Cargo.toml:9:15
[INFO] [stderr]   |
[INFO] [stderr] 9 | [dependencies.serde_json]
[INFO] [stderr]   |               ^^^^^^^^^^^
[INFO] [stderr]   |
[INFO] [stderr] help: consider removing the dependency on `serde_json`
[INFO] [stderr] help: to still use for development builds, move to `dev-dependencies`
[INFO] [stderr] warning: `dagre` (manifest) generated 2 warnings
[INFO] [stderr]     Finished `release` profile [optimized] target(s) in 25.99s
[INFO] running `Command { std: "docker" "inspect" "bc89d7ced1fc2955cbe44c5f309ed7b3a9c2681a936e09851100f19beee49dc6", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "exec" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-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" "-w" "/opt/rustwide/workdir" "--user" "0:0" "bc89d7ced1fc2955cbe44c5f309ed7b3a9c2681a936e09851100f19beee49dc6" "/opt/rustwide/cargo-home/bin/cargo" "+1.100.0-beta.1" "test" "--frozen" "--release", kill_on_drop: false }`
[INFO] [stderr] warning: unused dependency `serde_json`
[INFO] [stderr]   --> Cargo.toml:17:19
[INFO] [stderr]    |
[INFO] [stderr] 17 | [dev-dependencies.serde_json]
[INFO] [stderr]    |                   ^^^^^^^^^^^
[INFO] [stderr]    |
[INFO] [stderr]    = note: `cargo::unused_dependencies` is set to `warn` by default
[INFO] [stderr] help: consider removing the dependency on `serde_json`
[INFO] [stderr] help: to still use for development builds, move to `dev-dependencies`
[INFO] [stderr] warning: unused dependency `serde_json`
[INFO] [stderr]  --> Cargo.toml:9:15
[INFO] [stderr]   |
[INFO] [stderr] 9 | [dependencies.serde_json]
[INFO] [stderr]   |               ^^^^^^^^^^^
[INFO] [stderr]   |
[INFO] [stderr] help: consider removing the dependency on `serde_json`
[INFO] [stderr] help: to still use for development builds, move to `dev-dependencies`
[INFO] [stderr] warning: `dagre` (manifest) generated 2 warnings
[INFO] [stderr]     Finished `release` profile [optimized] target(s) in 0.04s
[INFO] [stderr]      Running unittests src/lib.rs (/opt/rustwide/target/release/build/dagre/77c46a7f0da03f43/out/dagre-77c46a7f0da03f43)
[INFO] [stdout] 
[INFO] [stdout] running 538 tests
[INFO] [stdout] test graph::tests::all_shortest_paths_returns_distance_and_path_from_all_nodes ... ok
[INFO] [stdout] test graph::tests::all_shortest_paths_uses_incident_function ... ok
[INFO] [stdout] test graph::tests::all_shortest_paths_uses_weight_function ... ok
[INFO] [stdout] test graph::tests::all_shortest_paths_works_with_undirected ... ok
[INFO] [stdout] test graph::tests::bellman_ford_works_for_undirected ... ok
[INFO] [stdout] test graph::tests::can_create_compound_graph ... ok
[INFO] [stdout] test graph::tests::bellman_ford_infinity_for_unconnected ... ok
[INFO] [stdout] test graph::tests::children_defaults_to_empty_for_new_compound_node ... ok
[INFO] [stdout] test graph::tests::bellman_ford_returns_distance_and_path ... ok
[INFO] [stdout] test graph::tests::bellman_ford_distance_0_for_source ... ok
[INFO] [stdout] test graph::tests::bellman_ford_uses_weight_function ... ok
[INFO] [stdout] test graph::tests::can_create_multigraph ... ok
[INFO] [stdout] test graph::tests::bellman_ford_works_with_negative_edges ... ok
[INFO] [stdout] test graph::tests::children_of_parent_compound ... ok
[INFO] [stdout] test graph::tests::children_returns_all_nodes_for_non_compound_root ... ok
[INFO] [stdout] test graph::tests::children_returns_empty_for_non_compound_leaf ... ok
[INFO] [stdout] test graph::tests::bellman_ford_throws_for_negative_cycle - should panic ... ok
[INFO] [stdout] test graph::tests::children_returns_empty_for_unknown_compound_node ... ok
[INFO] [stdout] test graph::tests::children_returns_empty_for_non_compound_without_node ... ok
[INFO] [stdout] test graph::tests::children_without_parent_returns_top_level ... ok
[INFO] [stdout] test graph::tests::components_connected ... ok
[INFO] [stdout] test graph::tests::components_empty ... ok
[INFO] [stdout] test graph::tests::components_returns_nodes_connected_by_neighbor_in_digraph ... ok
[INFO] [stdout] test graph::tests::components_two_components ... ok
[INFO] [stdout] test graph::tests::components_unconnected_nodes ... ok
[INFO] [stdout] test graph::tests::compound_children_of_parent ... ok
[INFO] [stdout] test graph::tests::compound_parent_defaults_to_none ... ok
[INFO] [stdout] test graph::tests::components_single_node ... ok
[INFO] [stdout] test graph::tests::compound_set_parent ... ok
[INFO] [stdout] test graph::tests::compound_reset_parent_to_root ... ok
[INFO] [stdout] test graph::tests::can_create_undirected_graph ... ok
[INFO] [stdout] test graph::tests::compound_set_parent_creates_nodes ... ok
[INFO] [stdout] test graph::tests::compound_remove_node_reparents_children ... ok
[INFO] [stdout] test graph::tests::compound_top_level_nodes ... ok
[INFO] [stdout] test graph::tests::defaults_to_directed ... ok
[INFO] [stdout] test graph::tests::defaults_to_non_multigraph ... ok
[INFO] [stdout] test graph::tests::defaults_to_non_compound ... ok
[INFO] [stdout] test graph::tests::dfs_visits_each_node_once ... ok
[INFO] [stdout] test graph::tests::dijkstra_all_uses_weight_function ... ok
[INFO] [stdout] test graph::tests::dijkstra_works_for_undirected ... ok
[INFO] [stdout] test graph::tests::dijkstra_all_returns_0_for_node_itself ... ok
[INFO] [stdout] test graph::tests::dijkstra_returns_distance_and_path_to_other_nodes ... ok
[INFO] [stdout] test graph::tests::dijkstra_uses_weight_function ... ok
[INFO] [stdout] test graph::tests::dijkstra_works_for_undirected_reverse_start ... ok
[INFO] [stdout] test graph::tests::edge_display_format ... ok
[INFO] [stdout] test graph::tests::directed_edge_has_direction ... ok
[INFO] [stdout] test graph::tests::dijkstra_distance_zero_for_source ... ok
[INFO] [stdout] test graph::tests::dijkstra_all_returns_distance_and_path_from_all_nodes ... ok
[INFO] [stdout] test graph::tests::dijkstra_distance_and_path ... ok
[INFO] [stdout] test graph::tests::edge_by_obj_simple ... ok
[INFO] [stdout] test graph::tests::dijkstra_simple_path ... ok
[INFO] [stdout] test graph::tests::edge_by_obj_multigraph ... ok
[INFO] [stdout] test graph::tests::dijkstra_uses_optionally_supplied_edge_function ... ok
[INFO] [stdout] test graph::tests::edges_empty_graph ... ok
[INFO] [stdout] test graph::tests::edge_mut_allows_modification ... ok
[INFO] [stdout] test graph::tests::edges_returns_all_edges ... ok
[INFO] [stdout] test graph::tests::extract_path_returns_weight_and_path_from_source_to_dest ... ok
[INFO] [stdout] test graph::tests::filter_nodes_includes_multi_level_subgraphs ... ok
[INFO] [stdout] test graph::tests::extract_path_throws_for_invalid_destination - should panic ... ok
[INFO] [stdout] test graph::tests::extract_path_throws_for_invalid_source - should panic ... ok
[INFO] [stdout] test graph::tests::filter_nodes_copies_edges_for_matching_nodes ... ok
[INFO] [stdout] test graph::tests::filter_nodes_copies_matching_nodes ... ok
[INFO] [stdout] test graph::tests::edge_returns_none_for_nonexistent ... ok
[INFO] [stdout] test graph::tests::filter_nodes_preserves_compound_option ... ok
[INFO] [stdout] test graph::tests::filter_nodes_includes_subgraphs ... ok
[INFO] [stdout] test graph::tests::edge_returns_none_for_nonexistent_edge ... ok
[INFO] [stdout] test graph::tests::edges_returns_correct_edge_descriptors ... ok
[INFO] [stdout] test graph::tests::edge_returns_value_of_multi_edge ... ok
[INFO] [stdout] test graph::tests::edge_undirected_returns_either_direction ... ok
[INFO] [stdout] test graph::tests::extract_path_returns_source_to_source ... ok
[INFO] [stdout] test graph::tests::filter_nodes_preserves_directed_option ... ok
[INFO] [stdout] test graph::tests::all_shortest_paths_returns_0_for_node_itself ... ok
[INFO] [stdout] test graph::tests::filter_nodes_removes_edges_to_removed_nodes ... ok
[INFO] [stdout] test graph::tests::filter_nodes_returns_empty_graph_for_none_pass ... ok
[INFO] [stdout] test graph::tests::filter_nodes_preserves_multigraph_option ... ok
[INFO] [stdout] test graph::tests::filter_nodes_preserves_compound_parents ... ok
[INFO] [stdout] test graph::tests::find_cycles_acyclic ... ok
[INFO] [stdout] test graph::tests::find_cycles_empty ... ok
[INFO] [stdout] test graph::tests::find_cycles_finds_single_cycle ... ok
[INFO] [stdout] test graph::tests::dijkstra_infinity_for_unconnected ... ok
[INFO] [stdout] test graph::tests::find_cycles_finds_two_separate_cycles ... ok
[INFO] [stdout] test graph::tests::filter_nodes_returns_identical_graph_for_all_pass ... ok
[INFO] [stdout] test graph::tests::dijkstra_all_throws_for_negative_weights - should panic ... ok
[INFO] [stdout] test graph::tests::filter_nodes_promotes_child_when_parent_filtered_out ... ok
[INFO] [stdout] test graph::tests::floyd_warshall_handles_negative_weights ... ok
[INFO] [stdout] test graph::tests::floyd_warshall_includes_negative_self_edges ... ok
[INFO] [stdout] test graph::tests::floyd_warshall_uses_weight_function ... ok
[INFO] [stdout] test graph::tests::in_edges_filtered_by_source_multigraph ... ok
[INFO] [stdout] test graph::tests::in_edges_returns_edges_that_point_at_node ... ok
[INFO] [stdout] test graph::tests::has_no_edges_by_default ... ok
[INFO] [stdout] test graph::tests::graph_label_mut_allows_modification ... ok
[INFO] [stdout] test graph::tests::in_edges_returns_incoming ... ok
[INFO] [stdout] test graph::tests::find_cycles_triangle ... ok
[INFO] [stdout] test graph::tests::graph_debug_format ... ok
[INFO] [stdout] test graph::tests::find_cycles_single_node_self_loop ... ok
[INFO] [stdout] test graph::tests::in_edges_works_for_multigraph ... ok
[INFO] [stdout] test graph::tests::is_acyclic_false_for_cyclic ... ok
[INFO] [stdout] test graph::tests::is_acyclic_false_for_self_loop ... ok
[INFO] [stdout] test graph::tests::is_acyclic_true_for_dag ... ok
[INFO] [stdout] test graph::tests::in_edges_returns_empty_for_source_node ... ok
[INFO] [stdout] test graph::tests::is_leaf_false_for_connected_undirected ... ok
[INFO] [stdout] test graph::tests::find_cycles_multiple_mixed ... ok
[INFO] [stdout] test graph::tests::find_cycles_two_node_cycle ... ok
[INFO] [stdout] test graph::tests::is_leaf_false_for_predecessor_directed ... ok
[INFO] [stdout] test graph::tests::find_cycles_self_loop ... ok
[INFO] [stdout] test graph::tests::floyd_warshall_returns_0_for_node_itself ... ok
[INFO] [stdout] test graph::tests::floyd_warshall_returns_all_distances ... ok
[INFO] [stdout] test graph::tests::graph_default_same_as_new ... ok
[INFO] [stdout] test graph::tests::has_no_nodes_by_default ... ok
[INFO] [stdout] test graph::tests::in_edges_filtered_by_source ... ok
[INFO] [stdout] test graph::tests::json_preserves_graph_value ... ok
[INFO] [stdout] test graph::tests::in_edges_returns_none_for_unknown_node ... ok
[INFO] [stdout] test graph::tests::json_preserves_parent_child_relationships ... ok
[INFO] [stdout] test graph::tests::is_leaf_true_for_unconnected_directed ... ok
[INFO] [stdout] test graph::tests::is_leaf_for_sink_node ... ok
[INFO] [stdout] test graph::tests::is_leaf_true_for_successor_directed ... ok
[INFO] [stdout] test graph::tests::json_preserves_multi_edges ... ok
[INFO] [stdout] test graph::tests::json_preserves_graph_options ... ok
[INFO] [stdout] test graph::tests::json_preserves_nodes ... ok
[INFO] [stdout] test graph::tests::multigraph_remove_named_edge ... ok
[INFO] [stdout] test graph::tests::json_preserves_simple_edges ... ok
[INFO] [stdout] test graph::tests::multigraph_allows_named_edges ... ok
[INFO] [stdout] test graph::tests::graph_label_defaults_to_none ... ok
[INFO] [stdout] test graph::tests::node_edges_between_specific_nodes_multigraph ... ok
[INFO] [stdout] test graph::tests::is_acyclic_false_for_single_node_cycle ... ok
[INFO] [stdout] test graph::tests::node_edges_returns_all_incident_edges ... ok
[INFO] [stdout] test graph::tests::is_leaf_for_isolated_node ... ok
[INFO] [stdout] test graph::tests::neighbors_includes_self_loop ... ok
[INFO] [stdout] test graph::tests::node_edges_works_for_multigraph ... ok
[INFO] [stdout] test graph::tests::neighbors_returns_all_adjacent ... ok
[INFO] [stdout] test graph::tests::node_mut_allows_modification ... ok
[INFO] [stdout] test graph::tests::parent_returns_current_assignment ... ok
[INFO] [stdout] test graph::tests::neighbors_returns_none_for_unknown_node ... ok
[INFO] [stdout] test graph::tests::out_edges_works_for_multigraph ... ok
[INFO] [stdout] test graph::tests::is_leaf_true_for_unconnected_undirected ... ok
[INFO] [stdout] test graph::tests::parent_returns_none_for_non_compound ... ok
[INFO] [stdout] test graph::tests::node_edges_returns_all_incident ... ok
[INFO] [stdout] test graph::tests::nodes_empty_graph ... ok
[INFO] [stdout] test graph::tests::node_returns_none_for_nonexistent ... ok
[INFO] [stdout] test graph::tests::node_edges_returns_none_for_unknown_node ... ok
[INFO] [stdout] test graph::tests::nodes_returns_all_nodes ... ok
[INFO] [stdout] test graph::tests::out_edges_filtered_by_target_multigraph ... ok
[INFO] [stdout] test graph::tests::out_edges_returns_all_outgoing ... ok
[INFO] [stdout] test graph::tests::parent_returns_none_for_unknown_node ... ok
[INFO] [stdout] test graph::tests::postorder_multiple_roots ... ok
[INFO] [stdout] test graph::tests::postorder_singleton ... ok
[INFO] [stdout] test graph::tests::postorder_tree ... ok
[INFO] [stdout] test graph::tests::out_edges_filtered_by_target ... ok
[INFO] [stdout] test graph::tests::postorder_visits_each_node_once ... ok
[INFO] [stdout] test graph::tests::out_edges_returns_edges_from_node ... ok
[INFO] [stdout] test graph::tests::postorder_works_for_array_of_roots ... ok
[INFO] [stdout] test graph::tests::postorder_works_for_multiple_connected_roots ... ok
[INFO] [stdout] test graph::tests::postorder_works_for_tree ... ok
[INFO] [stdout] test graph::tests::predecessors_includes_self_loops ... ok
[INFO] [stdout] test graph::tests::predecessors_returns_incoming_nodes ... ok
[INFO] [stdout] test graph::tests::preorder_works_for_array_of_roots ... ok
[INFO] [stdout] test graph::tests::preorder_multiple_roots ... ok
[INFO] [stdout] test graph::tests::preorder_singleton ... ok
[INFO] [stdout] test graph::tests::predecessors_returns_none_for_unknown_node ... ok
[INFO] [stdout] test graph::tests::preorder_works_for_tree ... ok
[INFO] [stdout] test graph::tests::preorder_tree ... ok
[INFO] [stdout] test graph::tests::out_edges_returns_none_for_unknown_node ... ok
[INFO] [stdout] test graph::tests::preorder_visits_each_node_once ... ok
[INFO] [stdout] test graph::tests::priority_queue_decrease_does_not_increase ... ok
[INFO] [stdout] test graph::tests::priority_queue_extract_min_empty_returns_none ... ok
[INFO] [stdout] test graph::tests::prim_simple_graph ... ok
[INFO] [stdout] test graph::tests::priority_queue_extract_min_in_order ... ok
[INFO] [stdout] test graph::tests::priority_queue_insert_and_extract_min ... ok
[INFO] [stdout] test graph::tests::priority_queue_insert_multiple ... ok
[INFO] [stdout] test graph::tests::prim_deterministic_result ... ok
[INFO] [stdout] test graph::tests::out_edges_returns_outgoing ... ok
[INFO] [stdout] test graph::tests::priority_queue_new_is_empty ... ok
[INFO] [stdout] test graph::tests::reduce_applies_accumulator_to_all_nodes ... ok
[INFO] [stdout] test graph::tests::prim_empty_graph ... ok
[INFO] [stdout] test graph::tests::reduce_returns_initial_accumulator_for_empty_graph ... ok
[INFO] [stdout] test graph::tests::prim_single_node ... ok
[INFO] [stdout] test graph::tests::reduce_traverses_in_pre_order ... ok
[INFO] [stdout] test graph::tests::remove_edge_by_name_multigraph ... ok
[INFO] [stdout] test graph::tests::prim_throws_for_unconnected_graph - should panic ... ok
[INFO] [stdout] test graph::tests::remove_edge_correctly_removes_neighbors ... ok
[INFO] [stdout] test graph::tests::reduce_traverses_in_post_order ... ok
[INFO] [stdout] test graph::tests::remove_edge_keeps_nodes ... ok
[INFO] [stdout] test graph::tests::remove_edge_no_effect_when_absent ... ok
[INFO] [stdout] test graph::tests::remove_edge_correctly_decrements_neighbor_count_multigraph ... ok
[INFO] [stdout] test graph::tests::remove_edge_removes_edge ... ok
[INFO] [stdout] test graph::tests::remove_node_is_idempotent ... ok
[INFO] [stdout] test graph::tests::remove_edge_returns_label ... ok
[INFO] [stdout] test graph::tests::remove_edge_works_with_undirected ... ok
[INFO] [stdout] test graph::tests::priority_queue_decrease ... ok
[INFO] [stdout] test graph::tests::set_default_edge_label_does_not_change_existing ... ok
[INFO] [stdout] test graph::tests::remove_node_removes_node ... ok
[INFO] [stdout] test graph::tests::set_default_edge_label_does_not_override_existing_multi_edge ... ok
[INFO] [stdout] test graph::tests::set_default_edge_label_not_used_with_explicit_value ... ok
[INFO] [stdout] test graph::tests::set_default_node_label_does_not_change_existing ... ok
[INFO] [stdout] test graph::tests::remove_node_returns_label ... ok
[INFO] [stdout] test graph::tests::set_default_node_label_not_used_with_explicit_value ... ok
[INFO] [stdout] test graph::tests::set_default_node_label_with_constant_fn ... ok
[INFO] [stdout] test graph::tests::remove_node_removes_compound_relationships ... ok
[INFO] [stdout] test graph::tests::set_default_node_label_with_name_fn ... ok
[INFO] [stdout] test graph::tests::remove_node_removes_incident_edges ... ok
[INFO] [stdout] test graph::tests::set_edge_changes_value_for_multi_edge ... ok
[INFO] [stdout] test graph::tests::remove_nonexistent_node_returns_none ... ok
[INFO] [stdout] test graph::tests::set_edge_does_not_overwrite_with_none ... ok
[INFO] [stdout] test graph::tests::set_edge_overwrites_label ... ok
[INFO] [stdout] test graph::tests::set_edge_stringified_ids ... ok
[INFO] [stdout] test graph::tests::set_edge_stringified_ids_multigraph ... ok
[INFO] [stdout] test graph::tests::set_edge_undirected_handles_both_directions ... ok
[INFO] [stdout] test graph::tests::set_edge_with_label ... ok
[INFO] [stdout] test graph::tests::set_edge_directed_treats_opposite_as_distinct ... ok
[INFO] [stdout] test graph::tests::set_edge_with_default_label ... ok
[INFO] [stdout] test graph::tests::set_graph_label_and_get ... ok
[INFO] [stdout] test graph::tests::set_edge_panics_for_named_edge_on_non_multigraph - should panic ... ok
[INFO] [stdout] test graph::tests::set_edge_undirected_id_order ... ok
[INFO] [stdout] test graph::tests::set_node_does_not_overwrite_with_none ... ok
[INFO] [stdout] test graph::tests::set_edge_with_none_keeps_existing_value ... ok
[INFO] [stdout] test graph::tests::set_node_creates_node ... ok
[INFO] [stdout] test graph::tests::set_edge_creates_edge ... ok
[INFO] [stdout] test graph::tests::set_node_creates_with_no_label ... ok
[INFO] [stdout] test graph::tests::set_node_is_idempotent ... ok
[INFO] [stdout] test graph::tests::set_edge_creates_multi_edge_only_in_multigraph ... ok
[INFO] [stdout] test graph::tests::set_node_overwrites_label ... ok
[INFO] [stdout] test graph::tests::set_edge_creates_nodes_if_needed ... ok
[INFO] [stdout] test graph::tests::set_parent_creates_child_if_not_exist ... ok
[INFO] [stdout] test graph::tests::set_node_with_default_label ... ok
[INFO] [stdout] test graph::tests::set_node_with_label ... ok
[INFO] [stdout] test graph::tests::set_parent_removes_parent_on_none ... ok
[INFO] [stdout] test graph::tests::set_parent_stringified_id ... ok
[INFO] [stdout] test graph::tests::set_node_uses_stringified_id ... ok
[INFO] [stdout] test graph::tests::set_parent_moves_node_to_new_parent ... ok
[INFO] [stdout] test graph::tests::set_parent_throws_on_non_compound - should panic ... ok
[INFO] [stdout] test graph::tests::set_path_creates_chain ... ok
[INFO] [stdout] test graph::tests::set_parent_preserves_tree_invariant - should panic ... ok
[INFO] [stdout] test graph::tests::set_path_with_label ... ok
[INFO] [stdout] test graph::tests::sources_includes_isolated_nodes ... ok
[INFO] [stdout] test graph::tests::tarjan_empty_graph ... ok
[INFO] [stdout] test graph::tests::tarjan_single_component_for_triangle ... ok
[INFO] [stdout] test graph::tests::sinks_returns_nodes_with_no_out_edges ... ok
[INFO] [stdout] test graph::tests::tarjan_two_cycles ... ok
[INFO] [stdout] test graph::tests::successors_returns_empty_for_leaf ... ok
[INFO] [stdout] test graph::tests::successors_returns_none_for_unknown_node ... ok
[INFO] [stdout] test graph::tests::successors_returns_outgoing_nodes ... ok
[INFO] [stdout] test graph::tests::tarjan_multiple_components_with_singleton ... ok
[INFO] [stdout] test graph::tests::tarjan_single_component_for_cycle_of_1_edge ... ok
[INFO] [stdout] test graph::tests::sources_returns_nodes_with_no_in_edges ... ok
[INFO] [stdout] test graph::tests::tarjan_singletons_for_non_scc_nodes ... ok
[INFO] [stdout] test graph::tests::sinks_includes_isolated_nodes ... ok
[INFO] [stdout] test graph::tests::topsort_diamond ... ok
[INFO] [stdout] test graph::tests::topsort_empty_graph ... ok
[INFO] [stdout] test graph::tests::topsort_cycle_with_extra_edge ... ok
[INFO] [stdout] test graph::tests::undirected_in_edges_and_out_edges_are_same ... ok
[INFO] [stdout] test graph::tests::topsort_simple_chain ... ok
[INFO] [stdout] test graph::tests::topsort_sorts_earlier_nodes_before_later ... ok
[INFO] [stdout] test graph::tests::undirected_edge_both_directions ... ok
[INFO] [stdout] test graph::tests::tarjan_single_node ... ok
[INFO] [stdout] test graph::tests::undirected_predecessors_and_successors_are_same ... ok
[INFO] [stdout] test layout::intersect::tests::circle_horizontal_ray ... ok
[INFO] [stdout] test layout::intersect::tests::polygon_diamond_horizontal_ray ... ok
[INFO] [stdout] test layout::intersect::tests::ellipse_diagonal_ray ... ok
[INFO] [stdout] test layout::intersect::tests::polygon_hexagon_ray_to_vertex ... ok
[INFO] [stdout] test layout::intersect::tests::rect_at_center_returns_center ... ok
[INFO] [stdout] test layout::intersect::tests::rect_vertical_ray ... ok
[INFO] [stdout] test layout::intersect::tests::rect_horizontal_ray ... ok
[INFO] [stdout] test layout::position::bk::tests::align_blocks_across_multiple_layers ... ok
[INFO] [stdout] test layout::position::bk::tests::align_single_median_for_odd_adjacencies ... ok
[INFO] [stdout] test layout::position::bk::tests::align_coordinates_multiple_nodes ... ok
[INFO] [stdout] test graph::tests::topsort_detects_self_loop ... ok
[INFO] [stdout] test graph::tests::undirected_edge_retrieval_either_direction ... ok
[INFO] [stdout] test graph::tests::undirected_neighbors_returns_all ... ok
[INFO] [stdout] test layout::position::bk::tests::align_correctly_regardless_of_node_name_insertion_order ... ok
[INFO] [stdout] test graph::tests::topsort_cycle_with_isolated_node ... ok
[INFO] [stdout] test layout::intersect::tests::polygon_at_center_returns_center ... ok
[INFO] [stdout] test layout::position::bk::tests::balance_single_node_average_of_different_medians ... ok
[INFO] [stdout] test graph::tests::tarjan_chain_all_singletons ... ok
[INFO] [stdout] test layout::position::bk::tests::balance_single_node_shared_median ... ok
[INFO] [stdout] test layout::position::bk::tests::align_coordinates_single_node ... ok
[INFO] [stdout] test graph::tests::tarjan_cycle ... ok
[INFO] [stdout] test layout::position::bk::tests::hc_aligns_centers_of_nodes_in_same_block ... ok
[INFO] [stdout] test layout::position::bk::tests::hc_cascades_class_shift ... ok
[INFO] [stdout] test layout::position::bk::tests::hc_handles_labelpos_c ... ok
[INFO] [stdout] test graph::tests::topsort_detects_cycle ... ok
[INFO] [stdout] test layout::position::bk::tests::align_with_itself_if_no_adjacencies ... ok
[INFO] [stdout] test layout::position::bk::tests::align_with_left_median_when_possible ... ok
[INFO] [stdout] test layout::position::bk::tests::hc_handles_labelpos_l ... ok
[INFO] [stdout] test layout::position::bk::tests::hc_shifts_classes_by_max_sep_from_adjacent_block_1 ... ok
[INFO] [stdout] test layout::position::bk::tests::align_with_sole_adjacency ... ok
[INFO] [stdout] test layout::position::bk::tests::balance_multiple_nodes ... ok
[INFO] [stdout] test layout::position::bk::tests::align_with_right_median_when_left_is_unavailable ... ok
[INFO] [stdout] test layout::position::bk::tests::align_with_neither_median_if_both_unavailable ... ok
[INFO] [stdout] test layout::position::bk::tests::hc_single_node_at_origin ... ok
[INFO] [stdout] test layout::position::bk::tests::px_aligns_inner_segments ... ok
[INFO] [stdout] test layout::position::bk::tests::px_single_node_at_origin ... ok
[INFO] [stdout] test layout::position::bk::tests::px_centers_node_if_predecessor_of_two_same_sized ... ok
[INFO] [stdout] test layout::position::bk::tests::px_single_node_block_at_origin_different_sizes ... ok
[INFO] [stdout] test layout::position::bk::tests::px_single_node_block_at_origin ... ok
[INFO] [stdout] test layout::position::bk::tests::px_shifts_blocks_on_both_sides_of_aligned_block ... ok
[INFO] [stdout] test layout::position::bk::tests::smallest_width_takes_node_width_into_account ... ok
[INFO] [stdout] test layout::position::bk::tests::type1_does_mark_conflict_a_is_non_dummy ... ok
[INFO] [stdout] test layout::position::bk::tests::type1_does_mark_conflict_b_is_non_dummy ... ok
[INFO] [stdout] test layout::position::bk::tests::type1_does_mark_conflict_c_is_non_dummy ... ok
[INFO] [stdout] test layout::position::bk::tests::has_conflict_regardless_of_edge_orientation ... ok
[INFO] [stdout] test graph::tests::successors_includes_self_loops ... ok
[INFO] [stdout] test layout::position::bk::tests::has_conflict_works_for_multiple_conflicts_with_same_node ... ok
[INFO] [stdout] test layout::position::bk::tests::type1_does_not_mark_type0_conflicts_b_is_dummy ... ok
[INFO] [stdout] test layout::position::bk::tests::hc_separates_adjacent_nodes_by_nodesep ... ok
[INFO] [stdout] test layout::position::bk::tests::type1_does_not_mark_type0_conflicts_c_is_dummy ... ok
[INFO] [stdout] test layout::position::bk::tests::type2_marks_conflicts_favoring_border_segments_1 ... ok
[INFO] [stdout] test layout::position::bk::tests::hc_handles_labelpos_r ... ok
[INFO] [stdout] test layout::position::bk::tests::hc_separates_adjacent_edges_by_edgesep ... ok
[INFO] [stdout] test layout::position::bk::tests::hc_shifts_classes_by_max_sep_from_adjacent_block_2 ... ok
[INFO] [stdout] test layout::position::bk::tests::type2_marks_conflicts_favoring_border_segments_2 ... ok
[INFO] [stdout] test layout::rank::network_simplex::tests::calc_cut_value_3_node_gc_c_p ... ok
[INFO] [stdout] test layout::rank::network_simplex::tests::calc_cut_value_3_node_gc_c_rev_p ... ok
[INFO] [stdout] test layout::position::bk::tests::type1_does_mark_conflict_d_is_non_dummy ... ok
[INFO] [stdout] test layout::rank::network_simplex::tests::calc_cut_value_3_node_rev_gc_c_p ... ok
[INFO] [stdout] test layout::position::bk::tests::hc_separates_blocks_with_appropriate_separation ... ok
[INFO] [stdout] test layout::rank::network_simplex::tests::calc_cut_value_3_node_rev_gc_rev_c_p ... ok
[INFO] [stdout] test layout::rank::network_simplex::tests::calc_cut_value_4_node_gc_c_p_o_with_c_to_o ... ok
[INFO] [stdout] test layout::position::bk::tests::type1_does_not_mark_edges_that_have_no_conflict ... ok
[INFO] [stdout] test layout::rank::network_simplex::tests::calc_cut_value_4_node_gc_c_p_o_with_o_to_c ... ok
[INFO] [stdout] test layout::position::bk::tests::smallest_width_alignment_finds_correct ... ok
[INFO] [stdout] test layout::position::bk::tests::type1_does_not_mark_type0_conflicts_a_is_dummy ... ok
[INFO] [stdout] test layout::position::bk::tests::hc_separates_classes_with_appropriate_separation ... ok
[INFO] [stdout] test layout::rank::network_simplex::tests::can_assign_rank_to_single_node ... ok
[INFO] [stdout] test layout::rank::network_simplex::tests::calc_cut_value_2_node_tree_c_to_p ... ok
[INFO] [stdout] test layout::position::bk::tests::type1_does_not_mark_type0_conflicts_d_is_dummy ... ok
[INFO] [stdout] test layout::rank::network_simplex::tests::calc_cut_value_4_node_gc_c_rev_p_o_with_c_to_o ... ok
[INFO] [stdout] test layout::position::bk::tests::type1_does_not_mark_type0_conflicts_no_dummies ... ok
[INFO] [stdout] test layout::position::bk::tests::type1_does_not_mark_type2_conflicts_all_dummies ... ok
[INFO] [stdout] test layout::rank::network_simplex::tests::can_handle_multi_edges ... ok
[INFO] [stdout] test layout::rank::network_simplex::tests::calc_cut_value_4_node_gc_c_rev_p_o_with_o_to_c ... ok
[INFO] [stdout] test layout::rank::network_simplex::tests::calc_cut_value_4_node_o_gc_c_p_with_c_to_o ... ok
[INFO] [stdout] test layout::rank::network_simplex::tests::can_rank_gansner_graph ... ok
[INFO] [stdout] test layout::rank::network_simplex::tests::calc_cut_value_4_node_o_gc_c_p_with_o_to_c ... ok
[INFO] [stdout] test layout::rank::network_simplex::tests::calc_cut_value_4_node_o_gc_c_rev_p_with_c_to_o ... ok
[INFO] [stdout] test layout::rank::network_simplex::tests::can_assign_ranks_for_diamond ... ok
[INFO] [stdout] test layout::rank::network_simplex::tests::calc_cut_value_4_node_o_gc_c_rev_p_with_o_to_c ... ok
[INFO] [stdout] test layout::rank::network_simplex::tests::can_assign_rank_to_2_node_connected_graph ... ok
[INFO] [stdout] test layout::rank::network_simplex::tests::enter_edge_gansner_graph_1 ... ok
[INFO] [stdout] test layout::rank::network_simplex::tests::enter_edge_gansner_graph_2 ... ok
[INFO] [stdout] test layout::rank::network_simplex::tests::enter_edge_works_when_root_in_tail_component ... ok
[INFO] [stdout] test layout::rank::network_simplex::tests::enter_edge_finds_edge_from_head_to_tail_component ... ok
[INFO] [stdout] test layout::rank::network_simplex::tests::leave_edge_returns_none_if_no_negative_cutvalue ... ok
[INFO] [stdout] test layout::rank::network_simplex::tests::calc_cut_value_2_node_tree_p_to_c ... ok
[INFO] [stdout] test layout::rank::network_simplex::tests::enter_edge_gansner_graph_4 ... ok
[INFO] [stdout] test layout::rank::network_simplex::tests::exchange_edges_updates_cut_values_and_low_lim ... ok
[INFO] [stdout] test layout::rank::network_simplex::tests::exchange_edges_updates_ranks ... ok
[INFO] [stdout] test layout::tests::acyclic_breaks_cycles ... ok
[INFO] [stdout] test layout::tests::acyclic_does_not_change_diamond_acyclic_graph ... ok
[INFO] [stdout] test layout::rank::network_simplex::tests::uses_minlen_attribute_on_edge ... ok
[INFO] [stdout] test layout::tests::acyclic_run_and_undo_restores_graph ... ok
[INFO] [stdout] test layout::rank::network_simplex::tests::init_cut_values_gansner_graph ... ok
[INFO] [stdout] test layout::tests::acyclic_undo_preserves_edge_labels ... ok
[INFO] [stdout] test graph::tests::set_parent_has_parent_none_if_never_invoked ... ok
[INFO] [stdout] test layout::tests::acyclic_run_and_undo_restores_reversed_edges ... ok
[INFO] [stdout] test graph::tests::set_parent_idempotent_remove ... ok
[INFO] [stdout] test layout::tests::add_border_segments_adds_border_for_multi_rank_subgraph ... ok
[INFO] [stdout] test layout::tests::acyclic_dfs_creates_multi_edge_where_necessary ... ok
[INFO] [stdout] test layout::tests::acyclic_dfs_does_not_change_acyclic_diamond ... ok
[INFO] [stdout] test layout::rank::network_simplex::tests::init_cut_values_updated_gansner_graph ... ok
[INFO] [stdout] test layout::tests::acyclic_does_not_change_acyclic_graph ... ok
[INFO] [stdout] test layout::rank::network_simplex::tests::init_low_lim_values_assigns_low_lim_parent ... ok
[INFO] [stdout] test layout::rank::network_simplex::tests::leave_edge_returns_edge_with_negative_cutvalue ... ok
[INFO] [stdout] test layout::tests::add_border_segments_does_not_add_for_non_compound_graph ... ok
[INFO] [stdout] test layout::tests::add_subgraph_constraints_contiguous_subgraph_no_constraint ... ok
[INFO] [stdout] test layout::tests::acyclic_greedy_prefers_to_break_at_low_weight_edges ... ok
[INFO] [stdout] test layout::tests::as_non_compound_copies_all_nodes ... ok
[INFO] [stdout] test layout::tests::add_subgraph_constraints_different_parents_adds_constraint ... ok
[INFO] [stdout] test layout::tests::add_subgraph_constraints_flat_nodes_no_change ... ok
[INFO] [stdout] test layout::tests::add_border_segments_adds_borders_for_nested_subgraphs ... ok
[INFO] [stdout] test layout::rank::network_simplex::tests::enter_edge_gansner_graph_3 ... ok
[INFO] [stdout] test layout::tests::as_non_compound_copies_all_edges ... ok
[INFO] [stdout] test layout::tests::add_border_segments_does_not_add_for_graph_with_no_clusters ... ok
[INFO] [stdout] test layout::tests::add_subgraph_constraints_works_for_multiple_levels ... ok
[INFO] [stdout] test layout::tests::build_layer_graph_copies_flat_nodes_from_layer ... ok
[INFO] [stdout] test layout::rank::network_simplex::tests::enter_edge_finds_edge_with_least_slack ... ok
[INFO] [stdout] test layout::tests::build_layer_graph_places_movable_nodes_under_root ... ok
[INFO] [stdout] test layout::tests::barycenter_calculates_for_all_nodes_in_movable_layer ... ok
[INFO] [stdout] test layout::tests::build_layer_graph_copies_out_edges_incident_on_rank_nodes ... ok
[INFO] [stdout] test layout::tests::barycenter_assigns_position_of_sole_predecessor ... ok
[INFO] [stdout] test layout::tests::build_layer_graph_collapses_multi_edges ... ok
[INFO] [stdout] test layout::tests::as_non_compound_does_not_copy_compound_nodes ... ok
[INFO] [stdout] test layout::tests::build_layer_graph_copies_in_edges_incident_on_rank_nodes ... ok
[INFO] [stdout] test layout::tests::coord_adjust_tb_does_nothing ... ok
[INFO] [stdout] test layout::tests::build_layer_graph_preserves_hierarchy_for_movable_layer ... ok
[INFO] [stdout] test layout::tests::barycenter_assigns_average_of_multiple_predecessors ... ok
[INFO] [stdout] test layout::tests::build_layer_matrix_produces_correct_layers ... ok
[INFO] [stdout] test layout::tests::add_border_segments_adds_border_for_single_rank_subgraph ... ok
[INFO] [stdout] test layout::tests::coord_undo_bt_negates_y ... ok
[INFO] [stdout] test layout::tests::coord_undo_lr_swaps_dims_and_coords ... ok
[INFO] [stdout] test layout::tests::barycenter_takes_into_account_edge_weight ... ok
[INFO] [stdout] test layout::tests::coord_undo_rl_swaps_and_negates ... ok
[INFO] [stdout] test layout::tests::build_layer_matrix_with_three_layers ... ok
[INFO] [stdout] test layout::tests::coord_undo_tb_does_nothing ... ok
[INFO] [stdout] test layout::tests::coord_adjust_bt_does_nothing ... ok
[INFO] [stdout] test layout::tests::cross_count_across_multiple_layers ... ok
[INFO] [stdout] test layout::tests::coord_adjust_lr_swaps_width_height ... ok
[INFO] [stdout] test layout::tests::cross_count_graph_one ... ok
[INFO] [stdout] test layout::tests::coord_adjust_rl_swaps_width_height ... ok
[INFO] [stdout] test layout::tests::cross_count_one_crossing ... ok
[INFO] [stdout] test layout::tests::cross_count_weighted_crossing ... ok
[INFO] [stdout] test layout::tests::cross_count_zero_for_empty_layering ... ok
[INFO] [stdout] test layout::tests::cross_count_zero_for_no_crossings ... ok
[INFO] [stdout] test layout::tests::barycenter_assigns_undefined_for_node_with_no_predecessors ... ok
[INFO] [stdout] test layout::tests::intersect_rect_bottom ... ok
[INFO] [stdout] test layout::tests::greedy_fas_returns_empty_for_empty_graph ... ok
[INFO] [stdout] test layout::tests::greedy_fas_returns_empty_for_single_node ... ok
[INFO] [stdout] test layout::tests::greedy_fas_returns_single_edge_for_simple_cycle ... ok
[INFO] [stdout] test layout::tests::greedy_fas_returns_single_edge_in_4_node_cycle ... ok
[INFO] [stdout] test layout::tests::greedy_fas_returns_two_edges_for_two_4_node_cycles ... ok
[INFO] [stdout] test layout::tests::greedy_fas_works_with_weighted_edges ... ok
[INFO] [stdout] test layout::tests::intersect_rect_left ... ok
[INFO] [stdout] test layout::tests::intersect_rect_right ... ok
[INFO] [stdout] test layout::tests::intersect_rect_top ... ok
[INFO] [stdout] test layout::tests::layout_adds_rectangle_intersects_for_edges ... ok
[INFO] [stdout] test layout::tests::greedy_fas_returns_empty_for_acyclic_graph ... ok
[INFO] [stdout] test layout::tests::greedy_fas_works_for_multigraphs ... ok
[INFO] [stdout] test layout::tests::layout_adds_rectangle_intersects_for_multi_rank_edges ... ok
[INFO] [stdout] test layout::tests::intersect_rect_touches_border ... ok
[INFO] [stdout] test layout::tests::layout_adds_dimensions_to_graph ... ok
[INFO] [stdout] test layout::tests::layout_assigns_edge_points ... ok
[INFO] [stdout] test layout::tests::layout_can_layout_edge_with_label ... ok
[INFO] [stdout] test layout::tests::layout_all_coords_positive ... ok
[INFO] [stdout] test layout::tests::layout_ensures_coords_in_bounding_box_lr ... ok
[INFO] [stdout] test layout::tests::layout_ensures_coords_in_bounding_box_tb ... ok
[INFO] [stdout] test layout::tests::layout_can_layout_two_nodes_connected ... ok
[INFO] [stdout] test layout::tests::layout_can_layout_graph_with_subgraphs ... ok
[INFO] [stdout] test layout::tests::layout_does_not_emit_consecutive_duplicate_edge_points ... ok
[INFO] [stdout] test layout::tests::layout_handles_cycle ... ok
[INFO] [stdout] test layout::tests::layout_handles_disconnected_components ... ok
[INFO] [stdout] test layout::tests::layout_can_layout_two_nodes_same_rank ... ok
[INFO] [stdout] test layout::tests::layout_longer_chain ... ok
[INFO] [stdout] test layout::tests::layout_nodes_same_rank_different_x ... ok
[INFO] [stdout] test layout::tests::layout_diamond_graph ... ok
[INFO] [stdout] test layout::tests::layout_chain_graph ... ok
[INFO] [stdout] test layout::tests::layout_multiple_disconnected_chains ... ok
[INFO] [stdout] test layout::tests::layout_can_layout_single_node_exact ... ok
[INFO] [stdout] test layout::tests::layout_can_layout_subgraphs_with_different_rankdirs ... ok
[INFO] [stdout] test layout::tests::layout_self_loop ... ok
[INFO] [stdout] test layout::tests::layout_minimizes_height_of_subgraphs ... ok
[INFO] [stdout] test layout::tests::layout_parallel_edges ... ok
[INFO] [stdout] test layout::tests::layout_long_edge_with_label ... ok
[INFO] [stdout] test layout::tests::layout_short_cycle ... ok
[INFO] [stdout] test layout::tests::layout_single_node ... ok
[INFO] [stdout] test layout::tests::layout_wide_node ... ok
[INFO] [stdout] test layout::tests::layout_two_connected_nodes ... ok
[INFO] [stdout] test layout::tests::nesting_run_adds_edge_from_root_to_each_node_correct_minlen_2 ... ok
[INFO] [stdout] test layout::tests::nesting_run_adds_border_nodes_to_top_and_bottom_of_subgraph ... ok
[INFO] [stdout] test layout::tests::nesting_run_adds_edge_from_root_to_each_node_correct_minlen_1 ... ok
[INFO] [stdout] test layout::tests::nesting_run_adds_edge_from_root_to_top_of_top_level_subgraphs ... ok
[INFO] [stdout] test layout::tests::nesting_run_adds_sufficient_weight_to_border_to_node_edges ... ok
[INFO] [stdout] test layout::tests::nesting_run_connects_disconnected_graph ... ok
[INFO] [stdout] test layout::tests::nesting_cleanup_removes_nesting_edges ... ok
[INFO] [stdout] test layout::tests::nesting_run_adds_edge_from_root_to_each_node_correct_minlen_3 ... ok
[INFO] [stdout] test layout::tests::nesting_run_does_not_add_edge_from_root_to_itself ... ok
[INFO] [stdout] test layout::tests::nesting_run_expands_inter_node_edges_1 ... ok
[INFO] [stdout] test layout::tests::nesting_run_adds_edges_between_borders_of_nested_subgraphs ... ok
[INFO] [stdout] test layout::tests::nesting_run_expands_inter_node_edges_2 ... ok
[INFO] [stdout] test layout::tests::normalize_splits_long_edge ... ok
[INFO] [stdout] test layout::tests::nesting_run_expands_inter_node_edges_3 ... ok
[INFO] [stdout] test layout::tests::normalize_preserves_edge_weight ... ok
[INFO] [stdout] test layout::tests::normalize_undo_sets_coords_and_dims_for_edge_label ... ok
[INFO] [stdout] test layout::tests::normalize_splits_two_layer_edge_into_segments ... ok
[INFO] [stdout] test layout::tests::normalize_undo_sets_coords_and_dims_for_long_edge_label ... ok
[INFO] [stdout] test layout::tests::order_assigns_unique_orders_per_rank ... ok
[INFO] [stdout] test layout::tests::order_assigns_order_to_nodes ... ok
[INFO] [stdout] test layout::tests::parent_dummy_chains_handles_lca_not_root_1 ... ok
[INFO] [stdout] test layout::tests::parent_dummy_chains_handles_lca_not_root_2 ... ok
[INFO] [stdout] test layout::tests::parent_dummy_chains_handles_long_chain_ending_in_subgraph ... ok
[INFO] [stdout] test layout::tests::parent_dummy_chains_handles_long_chain_starting_in_subgraph ... ok
[INFO] [stdout] test layout::tests::normalize_undo_restores_multi_edges ... ok
[INFO] [stdout] test layout::tests::nesting_cleanup_removes_root_node ... ok
[INFO] [stdout] test layout::tests::parent_dummy_chains_handles_nested_subgraphs ... ok
[INFO] [stdout] test layout::tests::parent_dummy_chains_handles_overlapping_rank_ranges ... ok
[INFO] [stdout] test layout::tests::parent_dummy_chains_no_parent_if_both_have_no_parent ... ok
[INFO] [stdout] test layout::tests::position_assigns_coordinates ... ok
[INFO] [stdout] test layout::tests::position_three_ranks_y_ordering ... ok
[INFO] [stdout] test layout::tests::position_two_nodes_same_rank_have_different_x ... ok
[INFO] [stdout] test layout::tests::normalize_undo_reverses_run ... ok
[INFO] [stdout] test layout::tests::predecessor_weights_maps_correctly ... ok
[INFO] [stdout] test layout::tests::position_y_increases_with_rank ... ok
[INFO] [stdout] test layout::tests::rank_assigns_ranks_to_chain ... ok
[INFO] [stdout] test layout::tests::rank_network_simplex_diamond ... ok
[INFO] [stdout] test layout::tests::rank_network_simplex_gansner_graph ... ok
[INFO] [stdout] test layout::tests::rank_network_simplex_single_node ... ok
[INFO] [stdout] test layout::tests::normalize_ranks_shifts_to_zero ... ok
[INFO] [stdout] test layout::tests::rank_network_simplex_two_nodes ... ok
[INFO] [stdout] test layout::tests::nesting_run_sets_minlen_correctly_for_nested_sg_border_to_children ... ok
[INFO] [stdout] test layout::tests::normalize_assigns_zero_dims_to_dummy_nodes ... ok
[INFO] [stdout] test layout::tests::normalize_does_not_change_short_edges ... ok
[INFO] [stdout] test layout::tests::normalize_ranks_works_for_negative_ranks ... ok
[INFO] [stdout] test layout::tests::normalize_undo_collects_points ... ok
[INFO] [stdout] test layout::tests::rank_network_simplex_uses_minlen ... ok
[INFO] [stdout] test layout::tests::layout_does_not_panic_on_empty_subgraph_nodes ... ok
[INFO] [stdout] test layout::tests::rank_respects_minlen ... ok
[INFO] [stdout] test layout::tests::resolve_conflicts_does_nothing_to_node_without_barycenter_or_constraint ... ok
[INFO] [stdout] test layout::tests::resolve_conflicts_returns_nodes_unchanged_no_constraints ... ok
[INFO] [stdout] test layout::tests::parent_dummy_chains_uses_heads_parent_if_tails_is_root ... ok
[INFO] [stdout] test layout::tests::normalize_run_assigns_width_height_from_edge_on_label_rank ... ok
[INFO] [stdout] test layout::tests::parent_dummy_chains_uses_tails_parent_for_first_node ... ok
[INFO] [stdout] test layout::tests::resolve_conflicts_treats_no_barycenter_as_always_violating_1 ... ok
[INFO] [stdout] test layout::tests::rank_assigns_rank_to_single_node ... ok
[INFO] [stdout] test layout::tests::remove_empty_ranks_removes_border_ranks ... ok
[INFO] [stdout] test layout::tests::resolve_conflicts_treats_no_barycenter_as_always_violating_2 ... ok
[INFO] [stdout] test layout::tests::resolve_conflicts_coalesces_nodes_on_conflict ... ok
[INFO] [stdout] test layout::tests::resolve_conflicts_ignores_edges_not_related_to_entries ... ok
[INFO] [stdout] test layout::tests::resolve_conflicts_multiple_constraints_same_target_1 ... ok
[INFO] [stdout] test layout::tests::resolve_conflicts_multiple_constraints_same_target_2 ... ok
[INFO] [stdout] test layout::tests::simplify_copies_no_multiedge ... ok
[INFO] [stdout] test layout::tests::resolve_conflicts_coalesces_nodes_on_conflict_2 ... ok
[INFO] [stdout] test layout::tests::sort_handles_barycenter_of_0 ... ok
[INFO] [stdout] test layout::tests::sort_biases_left_by_default ... ok
[INFO] [stdout] test layout::tests::simplify_collapses_multiedges ... ok
[INFO] [stdout] test layout::tests::sort_subgraph_assigns_barycenter_based_on_previous_border_nodes ... ok
[INFO] [stdout] test layout::tests::sort_can_sort_nodes_without_barycenter ... ok
[INFO] [stdout] test layout::tests::sort_subgraph_can_sort_nested_subgraph_no_in_edges ... ok
[INFO] [stdout] test layout::tests::sort_subgraph_can_sort_nested_subgraph_no_barycenter ... ok
[INFO] [stdout] test layout::tests::sort_handles_no_barycenters_for_any_nodes ... ok
[INFO] [stdout] test layout::tests::sort_sorts_nodes_by_barycenter ... ok
[INFO] [stdout] test layout::tests::sort_subgraph_aggregates_stats ... ok
[INFO] [stdout] test layout::tests::sort_subgraph_can_sort_nested_subgraph_with_barycenter ... ok
[INFO] [stdout] test layout::tests::sort_can_sort_super_nodes ... ok
[INFO] [stdout] test layout::tests::resolve_conflicts_returns_nodes_unchanged_no_conflicts ... ok
[INFO] [stdout] test layout::tests::sort_subgraph_biases_right_with_reverse_bias ... ok
[INFO] [stdout] test layout::tests::sort_biases_right_if_bias_right_true ... ok
[INFO] [stdout] test layout::tests::util_build_layer_matrix_creates_correct_matrix ... ok
[INFO] [stdout] test layout::tests::successor_weights_maps_correctly ... ok
[INFO] [stdout] test layout::tests::sort_subgraph_sorts_border_nodes_to_extremes ... ok
[INFO] [stdout] test layout::tests::util_intersect_rect_creates_slope_intersecting_center ... ok
[INFO] [stdout] test layout::tests::util_normalize_ranks_adjust_ranks_to_zero ... ok
[INFO] [stdout] test layout::tests::util_remove_empty_ranks_removes_border_ranks ... ok
[INFO] [stdout] test layout::tests::util_normalize_ranks_does_not_assign_rank_to_subgraphs ... ok
[INFO] [stdout] test layout::tests::util_remove_empty_ranks_does_not_remove_non_border_ranks ... ok
[INFO] [stdout] test layout::tests::util_remove_empty_ranks_handles_parents_with_undefined_ranks ... ok
[INFO] [stdout] test layout::tests::sort_subgraph_preserves_pos_of_node_without_neighbors ... ok
[INFO] [stdout] test layout::tests::sort_subgraph_sorts_flat_by_barycenter ... ok
[INFO] [stdout] test layout::tests::sort_subgraph_biases_left_without_reverse_bias ... ok
[INFO] [stdout] test layout::tests::normalize_undo_merges_multiple_points ... ok
[INFO] [stdout] test layout::tests::layout_output_is_run_to_run_deterministic ... ok
[INFO] [stdout] 
[INFO] [stdout] test result: ok. 538 passed; 0 failed; 0 ignored; 0 measured; 0 filtered out; finished in 0.13s
[INFO] [stdout] 
[INFO] [stderr]      Running tests/cross_validate.rs (/opt/rustwide/target/release/build/dagre/b4f9f888944d3bcb/out/cross_validate-b4f9f888944d3bcb)
[INFO] [stdout] 
[INFO] [stdout] running 1 test
[INFO] [stderr]    Doc-tests dagre
[INFO] [stdout] test cross_validate_all_cases ... ok
[INFO] [stdout] 
[INFO] [stdout] test result: ok. 1 passed; 0 failed; 0 ignored; 0 measured; 0 filtered out; finished in 0.08s
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] running 1 test
[INFO] [stdout] test src/layout/intersect.rs - layout::intersect (line 30) ... ok
[INFO] [stdout] 
[INFO] [stdout] test result: ok. 1 passed; 0 failed; 0 ignored; 0 measured; 0 filtered out; finished in 0.00s
[INFO] [stdout] 
[INFO] [stdout] all doctests ran in 0.34s; merged doctests compilation took 0.33s
[INFO] running `Command { std: "docker" "inspect" "bc89d7ced1fc2955cbe44c5f309ed7b3a9c2681a936e09851100f19beee49dc6", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "bc89d7ced1fc2955cbe44c5f309ed7b3a9c2681a936e09851100f19beee49dc6", kill_on_drop: false }`
[INFO] [stdout] bc89d7ced1fc2955cbe44c5f309ed7b3a9c2681a936e09851100f19beee49dc6
