FrankenNetworkX Upstream Divergence Ledger Auto-generated by scripts/upstream_divergence_ledger.py (br-r37-c1-hchj7).
Combines static AST analysis (docs/delegation_ledger.json), per-fixture audit findings (docs/raw_vs_public_audit.json), Rust source KNOWN GAP markers, and closed bead history into a single per-function divergence table.
category
count
meaning
native-parity430
Rust-native execution; output matches NetworkX byte-for-byte
wrapper-patched24
Python wrapper post-processes raw output (sort, type-coerce, etc.) so the user-visible result matches NetworkX
intentionally-delegated132
Wrapper routes to NetworkX (via _call_networkx_for_parity) for some or all input shapes; not a Rust-native path
raw-known-gap1
Lower-level raw kernel has a documented gap; public wrapper hides the divergence via fallback
owner-acknowledged-limitation1
Divergence is intentional / out-of-scope; documented in source
DiGraph, Graph, HasACycle, MultiDiGraph, MultiGraph, NetworkXAlgorithmError, NetworkXError, NetworkXNoCycle, NetworkXNoPath, NetworkXNotImplemented, NetworkXPointlessConcept, NetworkXUnbounded, NetworkXUnfeasible, NodeNotFound, NotATree, PowerIterationFailedConvergence, _NotAPartition, __version__, _aa_native_scores, _betweenness_centrality_sampled_rust, _betweenness_centrality_subset_rust, _betweenness_centrality_subset_weighted_rust, _bfs_edges_raw, _bfs_layers_raw, _bfs_predecessors_raw, _bfs_successors_raw, _bfs_tree_raw, _bipartite_sets, _condensation_nx_ordered, _condensation_raw, _dfs_edges_raw, _dfs_postorder_nodes_raw, _dfs_predecessors_raw, _dfs_preorder_nodes_raw, _dfs_successors_raw, _dfs_tree_raw, _edge_betweenness_centrality_subset_rust, _edge_betweenness_centrality_subset_weighted_rust, _edge_bfs_raw, _edge_dfs_raw, _find_cliques_impl, _graph_edit_distance_common_rust, _is_isomorphic_rust, _jaccard_native_scores, _minimum_cut_raw, _minimum_cut_value_raw, _pa_native_scores, _prim_spanning_edges_native, _ra_native_scores, _raw_adamic_adar_index, _raw_all_pairs_bellman_ford_path, _raw_all_pairs_bellman_ford_path_length, _raw_all_pairs_dijkstra, _raw_all_pairs_dijkstra_path, _raw_all_pairs_dijkstra_path_length, _raw_all_pairs_shortest_path, _raw_all_pairs_shortest_path_length, _raw_all_shortest_paths, _raw_ancestors, _raw_antichains, _raw_approx_local_node_connectivity_undirected, _raw_articulation_points, _raw_astar_path, _raw_astar_path_length, _raw_attracting_components, _raw_average_clustering, _raw_average_neighbor_degree, _raw_average_node_connectivity, _raw_average_shortest_path_length, _raw_barycenter, _raw_bellman_ford_path, _raw_bellman_ford_path_length, _raw_betweenness_centrality, _raw_biconnected_component_edges, _raw_biconnected_components, _raw_bidirectional_shortest_path, _raw_bridges, _raw_center, _raw_chordal_graph_cliques, _raw_clique_removal, _raw_closeness_centrality, _raw_clustering, _raw_common_neighbors, _raw_complement, _raw_compose, _raw_connected_components, _raw_core_number, _raw_cut_size, _raw_cycle_basis, _raw_dag_longest_path, _raw_dag_longest_path_length, _raw_degree_assortativity_coefficient, _raw_degree_assortativity_coefficient_directed, _raw_degree_centrality, _raw_degree_histogram, _raw_descendants, _raw_descendants_at_distance, _raw_diameter, _raw_difference, _raw_dijkstra_path, _raw_dijkstra_path_length, _raw_dijkstra_predecessor_and_distance, _raw_dominance_frontiers, _raw_dominating_set, _raw_eccentricity, _raw_edge_betweenness_centrality, _raw_edge_betweenness_centrality_weighted, _raw_edge_boundary, _raw_edge_connectivity, _raw_edge_expansion, _raw_efficiency, _raw_eigenvector_centrality, _raw_enumerate_all_cliques, _raw_eulerian_circuit, _raw_eulerian_path, _raw_fast_could_be_isomorphic, _raw_faster_could_be_isomorphic, _raw_find_cliques, _raw_find_cliques_recursive, _raw_find_cycle, _raw_find_cycle_multigraph_simple, _raw_find_cycle_simple, _raw_find_negative_cycle, _raw_floyd_warshall, _raw_floyd_warshall_predecessor_and_distance, _raw_girth, _raw_global_efficiency, _raw_global_node_connectivity, _raw_greedy_color, _raw_greedy_color_directed, _raw_greedy_modularity_communities, _raw_group_degree_centrality, _raw_group_in_degree_centrality, _raw_group_out_degree_centrality, _raw_harmonic_centrality, _raw_has_eulerian_path, _raw_has_path, _raw_immediate_dominators, _raw_in_degree_centrality, _raw_intersection, _raw_is_aperiodic, _raw_is_arborescence, _raw_is_attracting_component, _raw_is_biconnected, _raw_is_bipartite, _raw_is_branching, _raw_is_chordal, _raw_is_connected, _raw_is_digraphical, _raw_is_directed_acyclic_graph, _raw_is_distance_regular, _raw_is_dominating_set, _raw_is_edge_cover, _raw_is_eulerian, _raw_is_forest, _raw_is_isolate, _raw_is_k_edge_connected, _raw_is_k_regular, _raw_is_planar, _raw_is_regular, _raw_is_semiconnected, _raw_is_semieulerian, _raw_is_simple_path, _raw_is_strongly_connected, _raw_is_tree, _raw_is_weakly_connected, _raw_isolates, _raw_jaccard_coefficient, _raw_johnson_path_directed, _raw_katz_centrality, _raw_kosaraju_strongly_connected_components, _raw_large_clique_size, _raw_lexicographic_topological_sort, _raw_link_pred_common_neighbor_degrees, _raw_link_pred_jaccard_counts, _raw_load_centrality, _raw_load_centrality_weighted, _raw_local_efficiency, _raw_louvain_communities, _raw_max_clique, _raw_max_weight_clique, _raw_max_weight_matching, _raw_maximal_independent_set, _raw_maximal_matching, _raw_maximum_flow, _raw_maximum_flow_value, _raw_maximum_independent_set, _raw_maximum_spanning_arborescence, _raw_maximum_spanning_tree, _raw_mdg_ss_dijkstra, _raw_mdg_ss_dijkstra_path_length, _raw_min_edge_cover, _raw_min_weight_matching, _raw_min_weighted_vertex_cover, _raw_minimum_branching, _raw_minimum_node_cut, _raw_minimum_spanning_arborescence, _raw_minimum_spanning_edges, _raw_minimum_spanning_tree, _raw_modularity, _raw_multi_source_dijkstra, _raw_multidigraph_dijkstra_path_length_target, _raw_multidigraph_dijkstra_path_target, _raw_multidigraph_transitive_closure, _raw_multigraph_minimum_spanning_tree, _raw_negative_edge_cycle, _raw_node_boundary, _raw_node_connected_component, _raw_node_connectivity, _raw_node_expansion, _raw_non_edges, _raw_normalized_cut_size, _raw_number_attracting_components, _raw_number_connected_components, _raw_number_of_isolates, _raw_number_of_spanning_trees, _raw_number_strongly_connected_components, _raw_number_weakly_connected_components, _raw_out_degree_centrality, _raw_pagerank, _raw_partition_spanning_tree, _raw_percolation_centrality_weighted, _raw_periphery, _raw_predecessor, _raw_preferential_attachment, _raw_prim_spanning_edges, _raw_radius, _raw_random_spanning_tree, _raw_resource_allocation_index, _raw_shortest_path, _raw_shortest_path_length_matrix, _raw_shortest_simple_paths, _raw_single_source_bellman_ford, _raw_single_source_bellman_ford_path, _raw_single_source_bellman_ford_path_length, _raw_single_source_dijkstra, _raw_single_source_dijkstra_path, _raw_single_source_dijkstra_path_length, _raw_single_source_shortest_path, _raw_single_source_shortest_path_length, _raw_single_target_dijkstra_path_length, _raw_single_target_shortest_path, _raw_single_target_shortest_path_length, _raw_spanner, _raw_strongly_connected_components, _raw_symmetric_difference, _raw_topological_generations, _raw_topological_sort, _raw_transitive_closure, _raw_transitive_reduction, _raw_transitivity, _raw_tree_broadcast_center, _raw_tree_broadcast_time, _raw_triangles, _raw_union, _raw_voterank, _raw_weakly_connected_components, _rust_all_simple_paths, _rust_all_triangles, _rust_balanced_tree, _rust_barabasi_albert_graph, _rust_barbell_graph, _rust_binomial_tree, _rust_bull_graph, _rust_caveman_graph, _rust_chordal_cycle_graph, _rust_chordal_graph_treewidth, _rust_chvatal_graph, _rust_circulant_graph, _rust_circular_ladder_graph, _rust_circular_ladder_graph_native, _rust_closeness_vitality, _rust_complete_bipartite_graph, _rust_complete_graph, _rust_complete_multipartite_graph, _rust_connected_watts_strogatz_graph, _rust_cubical_graph, _rust_cycle_graph, _rust_desargues_graph, _rust_diamond_graph, _rust_dodecahedral_graph, _rust_dorogovtsev_goltsev_mendes_graph, _rust_empty_graph, _rust_erdos_renyi_graph, _rust_frucht_graph, _rust_full_rary_tree, _rust_full_rary_tree_native, _rust_generalized_petersen_graph, _rust_gnp_random_digraph, _rust_gnp_random_graph, _rust_grid_2d_graph, _rust_grid_graph, _rust_heawood_graph, _rust_hoffman_singleton_graph, _rust_house_graph, _rust_house_x_graph, _rust_hypercube_graph, _rust_icosahedral_graph, _rust_kneser_graph, _rust_krackhardt_kite_graph, _rust_ladder_graph, _rust_lollipop_graph, _rust_make_max_clique_graph, _rust_moebius_kantor_graph, _rust_newman_watts_strogatz_graph, _rust_node_link_data, _rust_node_link_graph, _rust_null_graph, _rust_octahedral_graph, _rust_paley_graph, _rust_pappus_graph, _rust_path_graph, _rust_petersen_graph, _rust_powerlaw_cluster_graph, _rust_random_lobster_graph_lazy_int, _rust_random_regular_edges_pyset, _rust_random_regular_graph, _rust_random_regular_graph_pyset_order, _rust_read_adjlist, _rust_read_edgelist, _rust_read_gml, _rust_read_graphml, _rust_sedgewick_maze_graph, _rust_star_graph, _rust_stochastic_block_model, _rust_sudoku_graph, _rust_tadpole_graph, _rust_tetrahedral_graph, _rust_trivial_graph, _rust_truncated_cube_graph, _rust_truncated_tetrahedron_graph, _rust_turan_graph, _rust_tutte_graph, _rust_watts_strogatz_graph, _rust_wheel_graph, _rust_windmill_graph, _rust_write_adjlist, _rust_write_edgelist, _rust_write_gml, _rust_write_graphml, _shortest_path_length_raw, _transitive_closure_dag_inproc, _vf2pp_all_isomorphisms_rust, _vf2pp_isomorphism_rust, _voronoi_nearest_centers, all_pairs_dijkstra, all_pairs_shortest_path, all_pairs_shortest_path_length, ancestors, articulation_points, attracting_components, average_degree_connectivity, average_neighbor_degree, biconnected_component_edges, biconnected_components, bidirectional_shortest_path, clustering, common_neighbors, complement, connected_components, core_number, cycle_basis, degree_centrality, degree_histogram, descendants, dijkstra_predecessor_and_distance, edge_expansion, enumerate_all_cliques, fast_could_be_isomorphic, faster_could_be_isomorphic, find_cycle, girth, global_efficiency, group_degree_centrality, group_in_degree_centrality, group_out_degree_centrality, immediate_dominators, is_arborescence, is_biconnected, is_bipartite, is_branching, is_connected, is_digraphical, is_directed_acyclic_graph, is_distance_regular, is_edge_cover, is_empty, is_forest, is_k_regular, is_regular, is_semiconnected, is_simple_path, is_strongly_connected, is_tree, is_weakly_connected, isolates, local_efficiency, maximal_matching, maximum_spanning_tree, minimum_spanning_tree, node_attribute_xy, node_boundary, node_connected_component, node_expansion, non_edges, non_neighbors, number_attracting_components, number_connected_components, number_of_isolates, number_of_spanning_trees, number_strongly_connected_components, number_weakly_connected_components, onion_layers, percolation_centrality, selfloop_edges, shortest_path_length_matrix, single_source_shortest_path, single_source_shortest_path_length, single_target_shortest_path, single_target_shortest_path_length, spanner, square_clustering, strongly_connected_components, topological_generations, topological_sort, transitivity, tree_broadcast_center, tree_broadcast_time, triangles, weakly_connected_components
function
source
note
all_pairs_dijkstra_path_lengthraw-vs-public-audit
raw output is post-processed by wrapper to match nx
all_pairs_shortest_path_lengthraw-vs-public-audit
raw output is post-processed by wrapper to match nx
astar_path_lengthraw-vs-public-audit
raw output is post-processed by wrapper to match nx
barycenterraw-vs-public-audit
raw output is post-processed by wrapper to match nx
biconnected_componentsraw-vs-public-audit
raw output is post-processed by wrapper to match nx
bridgesraw-vs-public-audit
raw output is post-processed by wrapper to match nx
centerraw-vs-public-audit
raw output is post-processed by wrapper to match nx
dag_longest_pathraw-vs-public-audit
raw output is post-processed by wrapper to match nx
dag_longest_path_lengthraw-vs-public-audit
raw output is post-processed by wrapper to match nx
degree_centralityraw-vs-public-audit
raw output is post-processed by wrapper to match nx
degree_histogramraw-vs-public-audit
raw output is post-processed by wrapper to match nx
diameterraw-vs-public-audit
raw output is post-processed by wrapper to match nx
dijkstra_path_lengthraw-vs-public-audit
raw output is post-processed by wrapper to match nx
eccentricityraw-vs-public-audit
raw output is post-processed by wrapper to match nx
find_cliquesraw-vs-public-audit
raw output is post-processed by wrapper to match nx
girthraw-vs-public-audit
raw output is post-processed by wrapper to match nx
greedy_colorraw-vs-public-audit
raw output is post-processed by wrapper to match nx
is_forestraw-vs-public-audit
raw output is post-processed by wrapper to match nx
is_planarraw-vs-public-audit
raw output is post-processed by wrapper to match nx
is_treeraw-vs-public-audit
raw output is post-processed by wrapper to match nx
peripheryraw-vs-public-audit
raw output is post-processed by wrapper to match nx
radiusraw-vs-public-audit
raw output is post-processed by wrapper to match nx
single_source_dijkstra_path_lengthraw-vs-public-audit
raw output is post-processed by wrapper to match nx
transitivityraw-vs-public-audit
raw output is post-processed by wrapper to match nx
intentionally-delegated (132)
function
source
note
_complement_via_nxstatic-classification
wrapper calls _call_networkx_for_parity exclusively
_dijkstra_predecessor_and_distance_via_paritystatic-classification
wrapper calls _call_networkx_for_parity exclusively
_link_prediction_lazy_delegatestatic-classification
wrapper calls _call_networkx_for_parity exclusively
_minimal_branching_backend_implstatic-classification
wrapper calls _call_networkx_for_parity exclusively
_onion_layers_implstatic-classification
wrapper calls _call_networkx_for_parity exclusively
_trophic_levels_computestatic-classification
wrapper calls _call_networkx_for_parity exclusively
all_pairs_all_shortest_pathsstatic-classification
wrapper calls _call_networkx_for_parity exclusively
all_pairs_bellman_ford_pathstatic-classification
mixed-route: wrapper has both raw and parity-helper paths
all_pairs_bellman_ford_path_lengthstatic-classification
mixed-route: wrapper has both raw and parity-helper paths
all_pairs_dijkstra_pathstatic-classification
mixed-route: wrapper has both raw and parity-helper paths
all_pairs_dijkstra_path_lengthstatic-classification
mixed-route: wrapper has both raw and parity-helper paths
all_pairs_node_connectivitystatic-classification
wrapper calls _call_networkx_for_parity exclusively
all_shortest_pathsstatic-classification
mixed-route: wrapper has both raw and parity-helper paths
all_simple_edge_pathsstatic-classification
wrapper calls _call_networkx_for_parity exclusively
all_simple_pathsstatic-classification
wrapper calls _call_networkx_for_parity exclusively
all_topological_sortsstatic-classification
wrapper calls _call_networkx_for_parity exclusively
antichainsstatic-classification
wrapper calls _call_networkx_for_parity exclusively
approximate_current_flow_betweenness_centralitystatic-classification
wrapper calls _call_networkx_for_parity exclusively
astar_pathstatic-classification
mixed-route: wrapper has both raw and parity-helper paths
astar_path_lengthstatic-classification
mixed-route: wrapper has both raw and parity-helper paths
average_shortest_path_lengthstatic-classification
mixed-route: wrapper has both raw and parity-helper paths
barycenterstatic-classification
mixed-route: wrapper has both raw and parity-helper paths
bellman_ford_pathstatic-classification
mixed-route: wrapper has both raw and parity-helper paths
bellman_ford_path_lengthstatic-classification
mixed-route: wrapper has both raw and parity-helper paths
bellman_ford_predecessor_and_distancestatic-classification
wrapper calls _call_networkx_for_parity exclusively
betweenness_centralitystatic-classification
mixed-route: wrapper has both raw and parity-helper paths
bfs_treestatic-classification
wrapper calls _call_networkx_for_parity exclusively
bidirectional_dijkstrastatic-classification
wrapper calls _call_networkx_for_parity exclusively
bridgesstatic-classification
mixed-route: wrapper has both raw and parity-helper paths
centerstatic-classification
wrapper calls _call_networkx_for_parity exclusively
chain_decompositionstatic-classification
wrapper calls _call_networkx_for_parity exclusively
chordal_graph_cliquesstatic-classification
mixed-route: wrapper has both raw and parity-helper paths
closeness_centralitystatic-classification
mixed-route: wrapper has both raw and parity-helper paths
complete_to_chordal_graphstatic-classification
wrapper calls _call_networkx_for_parity exclusively
constraintstatic-classification
wrapper calls _call_networkx_for_parity exclusively
cut_sizestatic-classification
mixed-route: wrapper has both raw and parity-helper paths
degree_assortativity_coefficientstatic-classification
mixed-route: wrapper has both raw and parity-helper paths
dfs_labeled_edgesstatic-classification
wrapper calls _call_networkx_for_parity exclusively
diameterstatic-classification
mixed-route: wrapper has both raw and parity-helper paths
dijkstra_pathstatic-classification
mixed-route: wrapper has both raw and parity-helper paths
dijkstra_path_lengthstatic-classification
mixed-route: wrapper has both raw and parity-helper paths
directed_combinatorial_laplacian_matrixstatic-classification
wrapper calls _call_networkx_for_parity exclusively
directed_laplacian_matrixstatic-classification
wrapper calls _call_networkx_for_parity exclusively
dominating_setstatic-classification
mixed-route: wrapper has both raw and parity-helper paths
eccentricitystatic-classification
mixed-route: wrapper has both raw and parity-helper paths
edge_betweenness_centralitystatic-classification
mixed-route: wrapper has both raw and parity-helper paths
edge_boundarystatic-classification
mixed-route: wrapper has both raw and parity-helper paths
edge_connectivitystatic-classification
mixed-route: wrapper has both raw and parity-helper paths
edge_disjoint_pathsstatic-classification
wrapper calls _call_networkx_for_parity exclusively
effective_sizestatic-classification
wrapper calls _call_networkx_for_parity exclusively
eigenvector_centralitystatic-classification
mixed-route: wrapper has both raw and parity-helper paths
eulerian_circuitstatic-classification
wrapper calls _call_networkx_for_parity exclusively
eulerian_pathstatic-classification
mixed-route: wrapper has both raw and parity-helper paths
find_minimal_d_separatorstatic-classification
wrapper calls _call_networkx_for_parity exclusively
find_negative_cyclestatic-classification
mixed-route: wrapper has both raw and parity-helper paths
flow_hierarchystatic-classification
wrapper calls _call_networkx_for_parity exclusively
floyd_warshallstatic-classification
wrapper calls _call_networkx_for_parity exclusively
floyd_warshall_predecessor_and_distancestatic-classification
wrapper calls _call_networkx_for_parity exclusively
gnm_random_graphstatic-classification
wrapper calls _call_networkx_for_parity exclusively
goldberg_radzikstatic-classification
wrapper calls _call_networkx_for_parity exclusively
greedy_colorstatic-classification
mixed-route: wrapper has both raw and parity-helper paths
group_betweenness_centralitystatic-classification
wrapper calls _call_networkx_for_parity exclusively
harmonic_centralitystatic-classification
mixed-route: wrapper has both raw and parity-helper paths
harmonic_diameterstatic-classification
wrapper calls _call_networkx_for_parity exclusively
has_eulerian_pathstatic-classification
mixed-route: wrapper has both raw and parity-helper paths
has_pathstatic-classification
mixed-route: wrapper has both raw and parity-helper paths
hyper_wiener_indexstatic-classification
wrapper calls _call_networkx_for_parity exclusively
incremental_closeness_centralitystatic-classification
wrapper calls _call_networkx_for_parity exclusively
is_chordalstatic-classification
mixed-route: wrapper has both raw and parity-helper paths
is_dominating_setstatic-classification
mixed-route: wrapper has both raw and parity-helper paths
is_eulerianstatic-classification
mixed-route: wrapper has both raw and parity-helper paths
is_matchingstatic-classification
wrapper calls _call_networkx_for_parity exclusively
is_maximal_matchingstatic-classification
wrapper calls _call_networkx_for_parity exclusively
is_minimal_d_separatorstatic-classification
wrapper calls _call_networkx_for_parity exclusively
is_perfect_matchingstatic-classification
wrapper calls _call_networkx_for_parity exclusively
johnsonstatic-classification
mixed-route: wrapper has both raw and parity-helper paths
k_componentsstatic-classification
wrapper calls _call_networkx_for_parity exclusively
k_edge_componentsstatic-classification
wrapper calls _call_networkx_for_parity exclusively
k_edge_subgraphsstatic-classification
wrapper calls _call_networkx_for_parity exclusively
katz_centralitystatic-classification
mixed-route: wrapper has both raw and parity-helper paths
kosaraju_strongly_connected_componentsstatic-classification
mixed-route: wrapper has both raw and parity-helper paths
laplacian_centralitystatic-classification
wrapper calls _call_networkx_for_parity exclusively
load_centralitystatic-classification
mixed-route: wrapper has both raw and parity-helper paths
local_bridgesstatic-classification
wrapper calls _call_networkx_for_parity exclusively
max_weight_cliquestatic-classification
wrapper calls _call_networkx_for_parity exclusively
max_weight_matchingstatic-classification
wrapper calls _call_networkx_for_parity exclusively
maximum_branchingstatic-classification
wrapper calls _call_networkx_for_parity exclusively
maximum_flowstatic-classification
mixed-route: wrapper has both raw and parity-helper paths
maximum_flow_valuestatic-classification
mixed-route: wrapper has both raw and parity-helper paths
maximum_spanning_arborescencestatic-classification
mixed-route: wrapper has both raw and parity-helper paths
maximum_spanning_edgesstatic-classification
mixed-route: wrapper has both raw and parity-helper paths
minimum_branchingstatic-classification
mixed-route: wrapper has both raw and parity-helper paths
minimum_cutstatic-classification
wrapper calls _call_networkx_for_parity exclusively
minimum_cut_valuestatic-classification
wrapper calls _call_networkx_for_parity exclusively
minimum_edge_cutstatic-classification
wrapper calls _call_networkx_for_parity exclusively
minimum_node_cutstatic-classification
wrapper calls _call_networkx_for_parity exclusively
minimum_spanning_arborescencestatic-classification
mixed-route: wrapper has both raw and parity-helper paths
minimum_spanning_edgesstatic-classification
mixed-route: wrapper has both raw and parity-helper paths
multi_source_dijkstrastatic-classification
mixed-route: wrapper has both raw and parity-helper paths
negative_edge_cyclestatic-classification
mixed-route: wrapper has both raw and parity-helper paths
node_connectivitystatic-classification
mixed-route: wrapper has both raw and parity-helper paths
node_disjoint_pathsstatic-classification
wrapper calls _call_networkx_for_parity exclusively
normalized_cut_sizestatic-classification
mixed-route: wrapper has both raw and parity-helper paths
omegastatic-classification
wrapper calls _call_networkx_for_parity exclusively
pagerankstatic-classification
wrapper calls _call_networkx_for_parity exclusively
partition_spanning_treestatic-classification
mixed-route: wrapper has both raw and parity-helper paths
peripherystatic-classification
wrapper calls _call_networkx_for_parity exclusively
predecessorstatic-classification
mixed-route: wrapper has both raw and parity-helper paths
radiusstatic-classification
mixed-route: wrapper has both raw and parity-helper paths
random_referencestatic-classification
wrapper calls _call_networkx_for_parity exclusively
random_spanning_treestatic-classification
wrapper calls _call_networkx_for_parity exclusively
shortest_pathstatic-classification
mixed-route: wrapper has both raw and parity-helper paths
shortest_path_lengthstatic-classification
mixed-route: wrapper has both raw and parity-helper paths
shortest_simple_pathsstatic-classification
wrapper calls _call_networkx_for_parity exclusively
sigmastatic-classification
wrapper calls _call_networkx_for_parity exclusively
simple_cyclesstatic-classification
wrapper calls _call_networkx_for_parity exclusively
single_source_all_shortest_pathsstatic-classification
wrapper calls _call_networkx_for_parity exclusively
single_source_bellman_fordstatic-classification
mixed-route: wrapper has both raw and parity-helper paths
single_source_bellman_ford_pathstatic-classification
mixed-route: wrapper has both raw and parity-helper paths
single_source_bellman_ford_path_lengthstatic-classification
mixed-route: wrapper has both raw and parity-helper paths
single_source_dijkstrastatic-classification
mixed-route: wrapper has both raw and parity-helper paths
single_source_dijkstra_path_lengthstatic-classification
mixed-route: wrapper has both raw and parity-helper paths
spectral_orderingstatic-classification
wrapper calls _call_networkx_for_parity exclusively
stoer_wagnerstatic-classification
wrapper calls _call_networkx_for_parity exclusively
transitive_closurestatic-classification
mixed-route: wrapper has both raw and parity-helper paths
triadic_censusstatic-classification
wrapper calls _call_networkx_for_parity exclusively
trophic_differencesstatic-classification
wrapper calls _call_networkx_for_parity exclusively
trophic_incoherence_parameterstatic-classification
wrapper calls _call_networkx_for_parity exclusively
tutte_polynomialstatic-classification
wrapper calls _call_networkx_for_parity exclusively
weisfeiler_lehman_graph_hashstatic-classification
wrapper calls _call_networkx_for_parity exclusively
weisfeiler_lehman_subgraph_hashesstatic-classification
wrapper calls _call_networkx_for_parity exclusively
wiener_indexstatic-classification
wrapper calls _call_networkx_for_parity exclusively
function
source
note
is_planarrust-source-comment (crates/fnx-algorithms/src/lib.rs)
// KNOWN GAP (br-isplanarbroken): this is still a necessary-only test;
owner-acknowledged-limitation (1)
function
source
note
is_planarclosed-bead
br-r37-c1-n2md9: Short-circuit public is_planar with girth bound before LR fallback