Auto-generated by scripts/generate_coverage_matrix.py from franken_networkx.__all__ — do not edit manually.
| Category | Count | % | Rule |
|---|---|---|---|
| RUST_NATIVE | 21 | 2% | native extension exports from franken_networkx._fnx |
| PY_WRAPPER | 855 | 93% | Python-defined exports with no runtime NetworkX dependency detected |
| NX_DELEGATED | 0 | 0% | Python-defined exports that import or call NetworkX at runtime |
| CLASS | 32 | 3% | public classes, exceptions, iterators |
| CONSTANT | 3 | 0% | public non-callable values |
| Total public exports | 911 | unique names from franken_networkx.__all__ |
All declared public exports are classified. --check fails if this generated report drifts from the live module surface.
| Module | Count |
|---|---|
franken_networkx |
790 |
franken_networkx.readwrite |
35 |
franken_networkx._fnx |
21 |
franken_networkx.drawing.nx_pylab |
21 |
franken_networkx.drawing.layout |
15 |
networkx.exception |
12 |
networkx.algorithms.isomorphism.matchhelpers |
9 |
networkx.utils.heaps |
3 |
builtins |
2 |
networkx.algorithms.community.quality |
1 |
networkx.algorithms.tree.coding |
1 |
networkx.utils.configs |
1 |
bidirectional_shortest_pathbipartite_setsclique_removalglobal_node_connectivitygraph_clique_numberis_arborescenceis_bipartiteis_branchingis_connectedis_dominating_setis_emptyis_k_regularis_semieulerianlarge_clique_sizemax_cliquemaximal_independent_setmaximum_independent_setmin_weighted_vertex_covernumber_connected_componentsnumber_of_isolatesnumber_of_spanning_arborescences
LCF_graphLFR_benchmark_graphadamic_adar_indexadd_cycleadd_pathadd_staradjacency_dataadjacency_graphadjacency_matrixadjacency_spectrumalgebraic_connectivityall_neighborsall_node_cutsall_pairs_all_shortest_pathsall_pairs_bellman_ford_pathall_pairs_bellman_ford_path_lengthall_pairs_dijkstraall_pairs_dijkstra_pathall_pairs_dijkstra_path_lengthall_pairs_lowest_common_ancestorall_pairs_node_connectivityall_pairs_shortest_pathall_pairs_shortest_path_lengthall_shortest_pathsall_simple_edge_pathsall_simple_pathsall_topological_sortsall_triadsall_trianglesancestorsantichainsapply_matplotlib_colorsapproximate_current_flow_betweenness_centralityarf_layoutarticulation_pointsasadpour_atspastar_pathastar_path_lengthasyn_fluidcasyn_lpa_communitiesattr_matrixattr_sparse_matrixattracting_componentsattribute_assortativity_coefficientattribute_mixing_dictattribute_mixing_matrixaverage_clusteringaverage_degreeaverage_degree_connectivityaverage_neighbor_degreeaverage_node_connectivityaverage_shortest_path_lengthbalanced_treebarabasi_albert_graphbarbell_graphbarycenterbellman_ford_pathbellman_ford_path_lengthbellman_ford_predecessor_and_distancebethe_hessian_matrixbethe_hessian_spectrumbetweenness_centralitybetweenness_centrality_subsetbfs_beam_edgesbfs_edgesbfs_labeled_edgesbfs_layersbfs_layoutbfs_predecessorsbfs_successorsbfs_treebiadjacency_matrixbiconnected_component_edgesbiconnected_componentsbidirectional_dijkstrabinomial_graphbinomial_treebipartite_densitybipartite_layoutboruvka_mst_edgesboundary_expansionboykov_kolmogorovbranching_weightbridge_componentsbridgesbull_graphcapacity_scalingcartesian_productcategorical_edge_matchcategorical_multiedge_matchcategorical_node_matchcaveman_graphcc_dotcc_maxcc_mincd_indexcenterchain_decompositioncheck_planaritycheck_planarity_recursivechordal_cycle_graphchordal_graph_cliqueschordal_graph_treewidthchordless_cycleschristofideschromatic_polynomialchvatal_graphcirculant_graphcircular_ladder_graphcircular_layoutcloseness_centralitycloseness_vitalityclusteringcn_soundarajan_hopcroftcolliderscolorcombinatorial_embedding_to_poscommon_neighbor_centralitycommon_neighborscommunicabilitycommunicability_betweenness_centralitycommunicability_expcomplementcomplete_bipartite_graphcomplete_graphcomplete_multipartite_graphcomplete_to_chordal_graphcomposecompose_allcondensationconductanceconfiguration_modelconnected_caveman_graphconnected_componentsconnected_cuthill_mckee_orderingconnected_dominating_setconnected_double_edge_swapconnected_watts_strogatz_graphconstraintcontracted_edgecontracted_nodesconvert_node_labels_to_integerscore_numbercorona_productcost_of_flowcould_be_isomorphiccreate_empty_copycubical_graphcumulative_distributioncurrent_flow_betweenness_centralitycurrent_flow_betweenness_centrality_subsetcurrent_flow_closeness_centralitycut_sizecuthill_mckee_orderingcycle_basiscycle_graphcytoscape_datacytoscape_graphdag_longest_pathdag_longest_path_lengthdag_to_branchingdavis_southern_women_graphdedensifydegreedegree_assortativity_coefficientdegree_centralitydegree_histogramdegree_mixing_dictdegree_mixing_matrixdegree_pearson_correlation_coefficientdegree_sequence_treedegreesdense_gnm_random_graphdensest_subgraphdensitydesargues_graphdescendantsdescendants_at_distancedescribedfs_edgesdfs_labeled_edgesdfs_postorder_nodesdfs_predecessorsdfs_preorder_nodesdfs_successorsdfs_treediameterdiamond_graphdifferencedijkstra_pathdijkstra_path_lengthdijkstra_predecessor_and_distancedinitzdirected_combinatorial_laplacian_matrixdirected_configuration_modeldirected_edge_swapdirected_havel_hakimi_graphdirected_joint_degree_graphdirected_laplacian_matrixdirected_modularity_matrixdisjoint_uniondisjoint_union_alldispersiondisplaydodecahedral_graphdominance_frontiersdominating_setdorogovtsev_goltsev_mendes_graphdouble_edge_swapdrawdraw_bipartitedraw_circulardraw_forceatlas2draw_kamada_kawaidraw_networkxdraw_networkx_edge_labelsdraw_networkx_edgesdraw_networkx_labelsdraw_networkx_nodesdraw_planardraw_randomdraw_shelldraw_spectraldraw_springdual_barabasi_albert_graphduplication_divergence_grapheccentricityedge_betweenness_centralityedge_betweenness_centrality_subsetedge_betweenness_partitionedge_bfsedge_boundaryedge_connectivityedge_current_flow_betweenness_centralityedge_current_flow_betweenness_centrality_subsetedge_dfsedge_disjoint_pathsedge_expansionedge_load_centralityedge_subgraphedgesedges_equaledmonds_karpeffective_graph_resistanceeffective_sizeefficiencyego_grapheigenvector_centralityeigenvector_centrality_numpyempty_graphenumerate_all_cliqueseppstein_matchingequitable_colorequivalence_classeserdos_renyi_graphestrada_indexeulerian_circuiteulerian_patheulerizeexpected_degree_graphextended_barabasi_albert_graphfast_could_be_isomorphicfast_gnp_random_graphfast_label_propagation_communitiesfaster_could_be_isomorphicfiedler_vectorfind_asteroidal_triplefind_cliquesfind_cliques_recursivefind_cyclefind_induced_nodesfind_minimal_d_separatorfind_negative_cycleflorentine_families_graphflow_hierarchyflow_matrix_rowfloyd_warshallfloyd_warshall_numpyfloyd_warshall_predecessor_and_distanceforceatlas2_layoutfreezefrom_biadjacency_matrixfrom_dict_of_dictsfrom_dict_of_listsfrom_edgelistfrom_graph6_bytesfrom_nested_tuplefrom_numpy_arrayfrom_pandas_adjacencyfrom_pandas_edgelistfrom_prufer_sequencefrom_scipy_sparse_arrayfrom_sparse6_bytesfrozenfrucht_graphfruchterman_reingold_layoutfull_joinfull_rary_treegaussian_random_partition_graphgeneral_random_intersection_graphgeneralized_degreegeneralized_petersen_graphgenerate_adjlistgenerate_edgelistgenerate_gexfgenerate_gmlgenerate_graphmlgenerate_multiline_adjlistgenerate_network_textgenerate_pajekgenerate_random_pathsgeneric_bfs_edgesgeneric_edge_matchgeneric_multiedge_matchgeneric_node_matchgeographical_threshold_graphgeometric_edgesgeometric_soft_configuration_graphget_counterexampleget_counterexample_recursiveget_edge_attributesget_node_attributesgirthgirvan_newmanglobal_efficiencyglobal_parametersglobal_reaching_centralitygn_graphgnc_graphgnm_random_graphgnp_random_graphgnr_graphgoldberg_radzikgomory_hu_treegoogle_matrixgraph_atlasgraph_atlas_ggraph_edit_distancegraphs_equalgreedy_branchinggreedy_colorgreedy_modularity_communitiesgreedy_source_expansiongreedy_tspgrid_2d_graphgrid_graphgroup_betweenness_centralitygroup_closeness_centralitygroup_degree_centralitygroup_in_degree_centralitygroup_out_degree_centralitygutman_indexhamiltonian_pathharmonic_centralityharmonic_diameterharmonic_functionhas_bridgeshas_cyclehas_eulerian_pathhas_pathhavel_hakimi_graphheawood_graphhexagonal_lattice_graphhide_diedgeshide_edgeshide_multidiedgeshide_multiedgeshide_nodeshitshkn_harary_graphhnm_harary_graphhoffman_singleton_graphhopcroft_karp_matchinghouse_graphhouse_x_graphhyper_wiener_indexhypercube_graphicosahedral_graphidentified_nodesimmediate_dominatorsin_degree_centralityincidence_matrixincremental_closeness_centralityinduced_subgraphinfoinformation_centralityintersectionintersection_allintersection_arrayinterval_graphinverse_line_graphis_aperiodicis_at_freeis_attracting_componentis_biconnectedis_bipartite_node_setis_chordalis_connected_dominating_setis_d_separatoris_digraphicalis_directedis_directed_acyclic_graphis_distance_regularis_edge_coveris_eulerianis_forestis_frozenis_graphicalis_isolateis_isomorphicis_k_edge_connectedis_kl_connectedis_locally_k_edge_connectedis_matchingis_maximal_matchingis_minimal_d_separatoris_multigraphicalis_negatively_weightedis_partitionis_pathis_perfect_graphis_perfect_matchingis_planaris_pseudographicalis_reachableis_regularis_regular_expanderis_semiconnectedis_simple_pathis_strongly_connectedis_strongly_regularis_tournamentis_treeis_triadis_valid_degree_sequence_erdos_gallaiis_valid_degree_sequence_havel_hakimiis_valid_directed_joint_degreeis_valid_joint_degreeis_valid_tree_degree_sequenceis_weakly_connectedis_weightedisolatesjaccard_coefficientjohnsonjoin_treesjoint_degree_graphjunction_treek_clique_communitiesk_componentsk_corek_coronak_crustk_edge_augmentationk_edge_componentsk_edge_subgraphsk_factork_random_intersection_graphk_shellk_trusskamada_kawai_layoutkarate_club_graphkatz_centralitykatz_centrality_numpykemeny_constantkernighan_lin_bisectionkl_connected_subgraphkneser_graphkosaraju_strongly_connected_componentskrackhardt_kite_graphkruskal_mst_edgeslabel_propagation_communitiesladder_graphlaplacian_centralitylaplacian_matrixlaplacian_spectrumlatapy_clusteringlattice_referenceleiden_communitiesleiden_partitionsles_miserables_graphlexicographic_productlexicographic_topological_sortlexicographical_topological_sortline_graphload_centralitylocal_and_global_consistencylocal_bridgeslocal_constraintlocal_efficiencylocal_node_connectivitylocal_reaching_centralitylollipop_graphlouvain_communitieslouvain_partitionslowest_common_ancestormake_clique_bipartitemake_list_of_intsmake_max_clique_graphmargulis_gabber_galil_graphmatching_dict_to_setmax_flow_min_costmax_weight_cliquemax_weight_matchingmaximal_matchingmaximum_branchingmaximum_flowmaximum_flow_valuemaximum_matchingmaximum_spanning_arborescencemaximum_spanning_edgesmaximum_spanning_treemaybe_regular_expandermaybe_regular_expander_graphmetric_closuremin_cost_flowmin_cost_flow_costmin_edge_covermin_edge_dominating_setmin_maximal_matchingmin_weight_matchingmin_weighted_dominating_setminimal_branchingminimum_branchingminimum_cutminimum_cut_valueminimum_cycle_basisminimum_edge_cutminimum_node_cutminimum_spanning_arborescenceminimum_spanning_edgesminimum_spanning_treeminimum_st_edge_cutminimum_st_node_cutminimum_weight_full_matchingmixing_dictmixing_expansionmodular_productmodularitymodularity_matrixmodularity_spectrummoebius_kantor_graphmoral_graphmulti_source_dijkstramulti_source_dijkstra_pathmulti_source_dijkstra_path_lengthmultipartite_layoutmutual_weightmycielski_graphmycielskiannavigable_small_world_graphnegative_edge_cycleneighborsnetwork_simplexnewman_watts_strogatz_graphno_filternode_attribute_xynode_boundarynode_clique_numbernode_connected_componentnode_connectivitynode_degree_xynode_disjoint_pathsnode_expansionnode_link_datanode_link_graphnode_redundancynodesnodes_equalnodes_with_selfloopsnon_edgesnon_neighborsnon_randomnessnonisomorphic_treesnormalized_cut_sizenormalized_laplacian_matrixnormalized_laplacian_spectrumnormalized_mutual_weightnull_graphnumber_attracting_componentsnumber_of_cliquesnumber_of_edgesnumber_of_nodesnumber_of_nonisomorphic_treesnumber_of_selfloopsnumber_of_spanning_treesnumber_of_walksnumber_strongly_connected_componentsnumber_weakly_connected_componentsnumeric_assortativity_coefficientnumerical_edge_matchnumerical_multiedge_matchnumerical_node_matchoctahedral_graphomegaone_exchangeonion_layersoptimal_edit_pathsoptimize_edit_pathsoptimize_graph_edit_distanceout_degree_centralityoverall_reciprocitypagerankpaley_graphpanther_similaritypanther_vector_similaritypappus_graphparse_adjlistparse_edgelistparse_gexfparse_gmlparse_graph6parse_graphmlparse_ledaparse_multiline_adjlistparse_pajekparse_sparse6partial_duplication_graphpartition_spanning_treepath_graphpath_weightpercolation_centralityperipherypetersen_graphplanar_layoutplanted_partition_graphpowerpowerlaw_cluster_graphpowerlaw_sequencepredecessorpreferential_attachmentprefix_treeprefix_tree_recursivepreflow_pushprim_mst_edgesprojected_graphprominent_grouppseudo_peripheral_nodequotient_graphra_index_soundarajan_hopcroftradiusramsey_R2random_clustered_graphrandom_cographrandom_degree_sequence_graphrandom_geometric_graphrandom_internet_as_graphrandom_k_out_graphrandom_kernel_graphrandom_labeled_rooted_forestrandom_labeled_rooted_treerandom_labeled_treerandom_layoutrandom_lobsterrandom_lobster_graphrandom_partition_graphrandom_powerlaw_treerandom_powerlaw_tree_sequencerandom_referencerandom_regular_expander_graphrandom_regular_graphrandom_shell_graphrandom_spanning_treerandom_tournamentrandom_treerandom_uniform_k_out_graphrandom_unlabeled_rooted_forestrandom_unlabeled_rooted_treerandom_unlabeled_treerandomized_partitioningread_adjlistread_edgelistread_gexfread_gmlread_graph6read_graphmlread_ledaread_multiline_adjlistread_pajekread_sparse6read_weighted_edgelistreciprocityreconstruct_pathrecursive_simple_cyclesrelabel_gexf_graphrelabel_nodesrelaxed_caveman_graphremove_edge_attributesremove_node_attributesrescale_layoutrescale_layout_dictresistance_distanceresource_allocation_indexrestricted_viewreversereverse_cuthill_mckee_orderingreverse_viewrich_club_coefficientring_of_cliquesrobins_alexander_clusteringrooted_productrooted_tree_isomorphisms_metricscale_free_graphschultz_indexscore_sequencesecond_order_centralitysedgewick_maze_graphselfloop_edgesset_edge_attributesset_node_attributessetsshell_layoutshortest_augmenting_pathshortest_pathshortest_path_lengthshortest_simple_pathsshow_diedgesshow_edgesshow_multidiedgesshow_multiedgesshow_nodessigmasimple_cyclessimrank_similaritysimulated_annealing_tspsingle_source_all_shortest_pathssingle_source_bellman_fordsingle_source_bellman_ford_pathsingle_source_bellman_ford_path_lengthsingle_source_dijkstrasingle_source_dijkstra_pathsingle_source_dijkstra_path_lengthsingle_source_shortest_pathsingle_source_shortest_path_lengthsingle_target_shortest_pathsingle_target_shortest_path_lengthsnap_aggregationsoft_random_geometric_graphspannerspectral_bisectionspectral_graph_forgespectral_layoutspectral_orderingspiral_layoutspring_layoutsquare_clusteringstar_graphsteiner_treestochastic_block_modelstochastic_graphstoer_wagnerstrategy_connected_sequentialstrategy_connected_sequential_bfsstrategy_connected_sequential_dfsstrategy_independent_setstrategy_largest_firststrategy_random_sequentialstrategy_saturation_largest_firststrategy_smallest_laststrong_productstrongly_connected_componentssubgraphsubgraph_centralitysubgraph_centrality_expsubgraph_viewsudoku_graphsymmetric_differencetadpole_graphtensor_producttetrahedral_graphthreshold_accepting_tspthresholded_random_geometric_graphto_dict_of_dictsto_dict_of_liststo_directedto_edgelistto_graph6_bytesto_latexto_latex_rawto_nested_tupleto_networkx_graphto_numpy_arrayto_pandas_adjacencyto_pandas_edgelistto_prufer_sequenceto_scipy_sparse_arrayto_sparse6_bytesto_undirectedto_vertex_covertopological_generationstopological_sorttournament_matrixtransitive_closuretransitive_closure_dagtransitive_reductiontransitivitytraveling_salesman_problemtree_all_pairs_lowest_common_ancestortree_broadcast_centertree_broadcast_timetree_datatree_graphtree_isomorphismtreewidth_min_degreetreewidth_min_fill_intriad_graphtriad_typetriadic_censustriads_by_typetrianglestriangular_lattice_graphtrivial_graphtrophic_differencestrophic_incoherence_parametertrophic_levelstruncated_cube_graphtruncated_tetrahedron_graphturan_graphtutte_graphtutte_polynomialuniform_random_intersection_graphunionunion_allv_structuresvf2pp_all_isomorphismsvf2pp_is_isomorphicvf2pp_isomorphismvisibility_graphvolumevoronoi_cellsvoterankwatts_strogatz_graphwaxman_graphweakly_connected_componentsweisfeiler_lehman_graph_hashweisfeiler_lehman_subgraph_hasheswheel_graphwiener_indexwindmill_graphwithin_inter_clusterwrite_adjlistwrite_edgelistwrite_gexfwrite_gmlwrite_graph6write_graphmlwrite_graphml_lxmlwrite_graphml_xmlwrite_latexwrite_multiline_adjlistwrite_network_textwrite_pajekwrite_sparse6write_weighted_edgelistzipf_rv
ArborescenceIteratorBinaryHeapDiGraphDiGraphMatcherEdgePartitionGraphGraphMatcherHasACycleISMAGSMinHeapMultiDiGraphMultiDiGraphMatcherMultiGraphMultiGraphMatcherNetworkXAlgorithmErrorNetworkXErrorNetworkXExceptionNetworkXNoCycleNetworkXNoPathNetworkXNotImplementedNetworkXPointlessConceptNetworkXTreewidthBoundExceededNetworkXUnboundedNetworkXUnfeasibleNodeNotFoundNotAPartitionNotATreePairingHeapPowerIterationFailedConvergenceSpanningTreeIteratorTimeRespectingDiGraphMatcherTimeRespectingGraphMatcher
__version__configisomorphism