types-networkx 3.6.1.20260303
Version history | Download JSON
-
PyPI https://pypi.org/project/types-networkx/ Repository https://github.com/python/typeshed -
py.typedstubs-only typeshed -
Coverage
%%{init: {"pie": {"textPosition": 0.85}, "theme": "neutral", "themeVariables": {"pieStrokeWidth": "1px"}}}%% pie title "Typed" : 3666 "Any" : 112 "Untyped" : 1363 -
Typables
%%{init: {"pie": {"textPosition": 0.85}, "theme": "neutral", "themeVariables": {"pieStrokeWidth": "1px"}}}%% pie title "functions" : 4146 "classes" : 860 "other" : 6- 963 functions (+55 overloads)
- 3183 parameters
- 92 classes
- 342 methods (+0 overloads)
- 465 parameters
- 50 properties
- 342 methods (+0 overloads)
- 269 modules
- 6 attrs
- 963 functions (+55 overloads)
Modules
Incomplete Annotations
networkx.algorithms.approximation.distance_measures (1 missing, 0 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
func |
networkx.algorithms.approximation.distance_measures.diameter |
3 | 2 | 0 |
networkx.algorithms.approximation.maxcut (2 missing, 0 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
func |
networkx.algorithms.approximation.maxcut.one_exchange |
5 | 4 | 0 |
func |
networkx.algorithms.approximation.maxcut.randomized_partitioning |
5 | 4 | 0 |
networkx.algorithms.approximation.ramsey (1 missing, 0 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
func |
networkx.algorithms.approximation.ramsey.ramsey_R2 |
2 | 1 | 0 |
networkx.algorithms.approximation.steinertree (3 missing, 0 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
func |
networkx.algorithms.approximation.steinertree.steiner_tree |
5 | 4 | 0 |
func |
networkx.algorithms.approximation.steinertree.metric_closure |
3 | 1 | 0 |
networkx.algorithms.approximation.traveling_salesman (15 missing, 0 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
func |
networkx.algorithms.approximation.traveling_salesman.simulated_annealing_tsp |
11 | 6 | 0 |
func |
networkx.algorithms.approximation.traveling_salesman.asadpour_atsp |
5 | 4 | 0 |
func |
networkx.algorithms.approximation.traveling_salesman.traveling_salesman_problem |
7 | 4 | 0 |
func |
networkx.algorithms.approximation.traveling_salesman.greedy_tsp |
4 | 2 | 0 |
func |
networkx.algorithms.approximation.traveling_salesman.threshold_accepting_tsp |
11 | 7 | 0 |
networkx.algorithms.assortativity.mixing (4 missing, 0 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
func |
networkx.algorithms.assortativity.mixing.degree_mixing_matrix |
8 | 7 | 0 |
func |
networkx.algorithms.assortativity.mixing.mixing_dict |
3 | 2 | 0 |
func |
networkx.algorithms.assortativity.mixing.attribute_mixing_matrix |
6 | 5 | 0 |
func |
networkx.algorithms.assortativity.mixing.degree_mixing_dict |
7 | 6 | 0 |
networkx.algorithms.assortativity.pairs (1 missing, 0 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
func |
networkx.algorithms.assortativity.pairs.node_attribute_xy |
4 | 3 | 0 |
networkx.algorithms.bipartite.basic (2 missing, 0 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
func |
networkx.algorithms.bipartite.basic.degrees |
4 | 3 | 0 |
func |
networkx.algorithms.bipartite.basic.density |
3 | 2 | 0 |
networkx.algorithms.bipartite.centrality (3 missing, 0 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
func |
networkx.algorithms.bipartite.centrality.closeness_centrality |
4 | 3 | 0 |
func |
networkx.algorithms.bipartite.centrality.degree_centrality |
3 | 2 | 0 |
func |
networkx.algorithms.bipartite.centrality.betweenness_centrality |
3 | 2 | 0 |
networkx.algorithms.bipartite.edgelist (11 missing, 0 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
func |
networkx.algorithms.bipartite.edgelist.read_edgelist |
9 | 3 | 0 |
func |
networkx.algorithms.bipartite.edgelist.parse_edgelist |
7 | 3 | 0 |
func |
networkx.algorithms.bipartite.edgelist.write_edgelist |
7 | 6 | 0 |
networkx.algorithms.bipartite.extendability (1 missing, 0 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
func |
networkx.algorithms.bipartite.extendability.maximal_extendability |
2 | 1 | 0 |
networkx.algorithms.bipartite.generators (13 missing, 0 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
func |
networkx.algorithms.complete_bipartite_graph |
4 | 1 | 0 |
func |
networkx.algorithms.bipartite.generators.alternating_havel_hakimi_graph |
4 | 3 | 0 |
func |
networkx.algorithms.bipartite.generators.complete_bipartite_graph |
4 | 1 | 0 |
func |
networkx.algorithms.bipartite.generators.random_graph |
6 | 5 | 0 |
func |
networkx.algorithms.bipartite.generators.preferential_attachment_graph |
5 | 4 | 0 |
func |
networkx.algorithms.bipartite.generators.configuration_model |
5 | 4 | 0 |
func |
networkx.algorithms.bipartite.generators.gnmk_random_graph |
6 | 5 | 0 |
func |
networkx.algorithms.bipartite.generators.havel_hakimi_graph |
4 | 3 | 0 |
func |
networkx.algorithms.bipartite.generators.reverse_havel_hakimi_graph |
4 | 3 | 0 |
networkx.algorithms.bipartite.matching (1 missing, 0 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
func |
networkx.algorithms.bipartite.matching.to_vertex_cover |
4 | 3 | 0 |
networkx.algorithms.bipartite.matrix (5 missing, 0 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
func |
networkx.algorithms.bipartite.matrix.from_biadjacency_matrix |
6 | 4 | 0 |
func |
networkx.algorithms.bipartite.matrix.biadjacency_matrix |
7 | 4 | 0 |
networkx.algorithms.bipartite.projection (6 missing, 0 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
func |
networkx.algorithms.projected_graph |
4 | 3 | 0 |
func |
networkx.algorithms.bipartite.projection.overlap_weighted_projected_graph |
4 | 3 | 0 |
func |
networkx.algorithms.bipartite.projection.weighted_projected_graph |
4 | 3 | 0 |
func |
networkx.algorithms.bipartite.projection.collaboration_weighted_projected_graph |
3 | 2 | 0 |
func |
networkx.algorithms.bipartite.projection.generic_weighted_projected_graph |
4 | 3 | 0 |
func |
networkx.algorithms.bipartite.projection.projected_graph |
4 | 3 | 0 |
networkx.algorithms.bipartite.spectral (1 missing, 0 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
func |
networkx.algorithms.bipartite.spectral.spectral_bipartivity |
4 | 3 | 0 |
networkx.algorithms.boundary (2 missing, 0 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
func |
networkx.algorithms.boundary.edge_boundary |
7 | 5 | 0 |
networkx.algorithms.centrality.closeness (1 missing, 0 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
func |
networkx.algorithms.centrality.closeness.closeness_centrality |
5 | 4 | 0 |
networkx.algorithms.centrality.flow_matrix (30 missing, 8 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
meth |
FullInverseLaplacian.init_solver |
2 | 1 | 0 |
meth |
FullInverseLaplacian.solve |
2 | 0 | 0 |
meth |
FullInverseLaplacian.solve_inverse |
2 | 0 | 0 |
attr |
FullInverseLaplacian.IL |
1 | 1 | 1 |
func |
networkx.algorithms.centrality.flow_matrix.flow_matrix_row |
5 | 3 | 0 |
meth |
CGInverseLaplacian.init_solver |
2 | 1 | 0 |
meth |
CGInverseLaplacian.solve |
2 | 0 | 0 |
meth |
CGInverseLaplacian.solve_inverse |
2 | 0 | 0 |
attr |
CGInverseLaplacian.M |
1 | 1 | 1 |
meth |
SuperLUInverseLaplacian.init_solver |
2 | 1 | 0 |
meth |
SuperLUInverseLaplacian.solve_inverse |
2 | 0 | 0 |
meth |
SuperLUInverseLaplacian.solve |
2 | 0 | 0 |
attr |
SuperLUInverseLaplacian.lusolve |
1 | 1 | 1 |
meth |
InverseLaplacian.init |
4 | 1 | 0 |
meth |
InverseLaplacian.init_solver |
2 | 1 | 0 |
meth |
InverseLaplacian.solve |
2 | 1 | 0 |
meth |
InverseLaplacian.solve_inverse |
2 | 1 | 0 |
meth |
InverseLaplacian.get_rows |
3 | 0 | 0 |
meth |
InverseLaplacian.get_row |
2 | 0 | 0 |
meth |
InverseLaplacian.width |
2 | 0 | 0 |
attr |
InverseLaplacian.dtype |
1 | 1 | 1 |
attr |
InverseLaplacian.n |
1 | 1 | 1 |
attr |
InverseLaplacian.w |
1 | 1 | 1 |
attr |
InverseLaplacian.C |
1 | 1 | 1 |
attr |
InverseLaplacian.L1 |
1 | 1 | 1 |
networkx.algorithms.centrality.group (2 missing, 0 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
func |
networkx.algorithms.centrality.group.group_betweenness_centrality |
6 | 4 | 0 |
networkx.algorithms.centrality.harmonic (1 missing, 0 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
func |
networkx.algorithms.centrality.harmonic.harmonic_centrality |
5 | 4 | 0 |
networkx.algorithms.centrality.laplacian (1 missing, 0 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
func |
networkx.algorithms.centrality.laplacian.laplacian_centrality |
7 | 6 | 0 |
networkx.algorithms.centrality.load (1 missing, 0 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
func |
networkx.algorithms.centrality.load.edge_load_centrality |
3 | 2 | 0 |
networkx.algorithms.centrality.trophic (3 missing, 0 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
func |
networkx.algorithms.centrality.trophic.trophic_levels |
3 | 2 | 0 |
func |
networkx.algorithms.centrality.trophic.trophic_incoherence_parameter |
4 | 3 | 0 |
func |
networkx.algorithms.centrality.trophic.trophic_differences |
3 | 2 | 0 |
networkx.algorithms.clique (6 missing, 0 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
func |
networkx.algorithms.clique.node_clique_number |
5 | 3 | 0 |
func |
networkx.algorithms.clique.max_weight_clique |
3 | 2 | 0 |
func |
networkx.algorithms.clique.number_of_cliques |
4 | 2 | 0 |
func |
networkx.algorithms.clique.make_clique_bipartite |
5 | 4 | 0 |
networkx.algorithms.cluster (3 missing, 0 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
func |
networkx.algorithms.cluster.triangles |
3 | 2 | 0 |
func |
networkx.algorithms.cluster.clustering |
4 | 3 | 0 |
func |
networkx.algorithms.cluster.generalized_degree |
3 | 2 | 0 |
networkx.algorithms.coloring.equitable_coloring (4 missing, 0 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
func |
networkx.algorithms.coloring.equitable_color |
3 | 1 | 0 |
func |
networkx.algorithms.coloring.equitable_coloring.equitable_color |
3 | 1 | 0 |
networkx.algorithms.coloring.greedy_coloring (13 missing, 0 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
func |
networkx.algorithms.coloring.greedy_color |
4 | 2 | 0 |
func |
networkx.algorithms.coloring.greedy_coloring.strategy_saturation_largest_first |
3 | 2 | 0 |
func |
networkx.algorithms.coloring.greedy_coloring.strategy_connected_sequential_bfs |
3 | 1 | 0 |
func |
networkx.algorithms.coloring.greedy_coloring.strategy_smallest_last |
3 | 2 | 0 |
func |
networkx.algorithms.coloring.greedy_coloring.strategy_random_sequential |
4 | 2 | 0 |
func |
networkx.algorithms.coloring.greedy_coloring.strategy_largest_first |
3 | 2 | 0 |
func |
networkx.algorithms.coloring.greedy_coloring.greedy_color |
4 | 2 | 0 |
func |
networkx.algorithms.coloring.greedy_coloring.strategy_connected_sequential_dfs |
3 | 1 | 0 |
networkx.algorithms.community.kclique (1 missing, 0 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
func |
networkx.algorithms.community.kclique.k_clique_communities |
4 | 3 | 0 |
networkx.algorithms.community.label_propagation (2 missing, 0 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
func |
networkx.algorithms.community.label_propagation.fast_label_propagation_communities |
4 | 2 | 0 |
networkx.algorithms.community.leiden (2 missing, 0 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
func |
networkx.algorithms.community.leiden.leiden_partitions |
5 | 4 | 0 |
func |
networkx.algorithms.community.leiden.leiden_communities |
6 | 5 | 0 |
networkx.algorithms.community.lukes (3 missing, 0 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
func |
networkx.algorithms.community.lukes.lukes_partitioning |
5 | 2 | 0 |
networkx.algorithms.community.modularity_max (1 missing, 0 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
func |
networkx.algorithms.community.modularity_max.naive_greedy_modularity_communities |
4 | 3 | 0 |
networkx.algorithms.community.quality (4 missing, 0 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
func |
networkx.algorithms.community.quality.partition_quality |
3 | 1 | 0 |
func |
networkx.algorithms.community.quality.modularity |
5 | 3 | 0 |
networkx.algorithms.connectivity.edge_kcomponents (5 missing, 2 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
func |
networkx.algorithms.k_edge_subgraphs |
3 | 2 | 0 |
func |
networkx.algorithms.k_edge_components |
3 | 2 | 0 |
meth |
EdgeComponentAuxGraph.construct |
2 | 1 | 0 |
attr |
EdgeComponentAuxGraph.A |
1 | 1 | 1 |
attr |
EdgeComponentAuxGraph.H |
1 | 1 | 1 |
func |
networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs |
3 | 2 | 0 |
func |
networkx.algorithms.connectivity.edge_kcomponents.k_edge_components |
3 | 2 | 0 |
networkx.algorithms.connectivity.stoerwagner (2 missing, 0 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
func |
networkx.algorithms.stoer_wagner |
4 | 3 | 0 |
func |
networkx.algorithms.connectivity.stoerwagner.stoer_wagner |
4 | 3 | 0 |
networkx.algorithms.connectivity.utils (2 missing, 0 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
func |
networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity |
2 | 1 | 0 |
func |
networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity |
2 | 1 | 0 |
networkx.algorithms.core (5 missing, 0 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
func |
networkx.algorithms.core.k_truss |
3 | 2 | 0 |
func |
networkx.algorithms.core.k_core |
4 | 3 | 0 |
func |
networkx.algorithms.core.k_crust |
4 | 3 | 0 |
func |
networkx.algorithms.core.k_shell |
4 | 3 | 0 |
func |
networkx.algorithms.core.k_corona |
4 | 3 | 0 |
networkx.algorithms.cuts (8 missing, 0 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
func |
networkx.algorithms.cuts.cut_size |
5 | 4 | 0 |
func |
networkx.algorithms.cuts.volume |
4 | 3 | 0 |
func |
networkx.algorithms.cuts.boundary_expansion |
3 | 2 | 0 |
func |
networkx.algorithms.cuts.normalized_cut_size |
5 | 4 | 0 |
func |
networkx.algorithms.cuts.mixing_expansion |
5 | 4 | 0 |
func |
networkx.algorithms.cuts.edge_expansion |
5 | 4 | 0 |
func |
networkx.algorithms.cuts.conductance |
5 | 4 | 0 |
func |
networkx.algorithms.cuts.node_expansion |
3 | 2 | 0 |
networkx.algorithms.cycles (1 missing, 0 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
func |
networkx.algorithms.cycles.find_cycle |
4 | 3 | 0 |
networkx.algorithms.d_separation (4 missing, 0 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
func |
networkx.algorithms.d_separation.find_minimal_d_separator |
6 | 2 | 0 |
networkx.algorithms.dag (3 missing, 0 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
func |
networkx.algorithms.dag.transitive_closure |
3 | 2 | 0 |
func |
networkx.algorithms.dag.descendants |
3 | 2 | 0 |
func |
networkx.algorithms.dag.ancestors |
3 | 2 | 0 |
networkx.algorithms.dominance (2 missing, 0 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
func |
networkx.algorithms.dominance.dominance_frontiers |
3 | 2 | 0 |
func |
networkx.algorithms.dominance.immediate_dominators |
3 | 2 | 0 |
networkx.algorithms.euler (2 missing, 0 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
func |
networkx.algorithms.euler.eulerian_path |
4 | 3 | 0 |
func |
networkx.algorithms.euler.eulerize |
2 | 1 | 0 |
networkx.algorithms.flow.boykovkolmogorov (1 missing, 0 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
func |
networkx.algorithms.flow.boykovkolmogorov.boykov_kolmogorov |
8 | 7 | 0 |
networkx.algorithms.flow.capacityscaling (2 missing, 0 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
func |
networkx.algorithms.capacity_scaling |
6 | 5 | 0 |
func |
networkx.algorithms.flow.capacityscaling.capacity_scaling |
6 | 5 | 0 |
networkx.algorithms.flow.dinitz_alg (1 missing, 0 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
func |
networkx.algorithms.flow.dinitz_alg.dinitz |
8 | 7 | 0 |
networkx.algorithms.flow.edmondskarp (1 missing, 0 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
func |
networkx.algorithms.flow.edmondskarp.edmonds_karp |
8 | 7 | 0 |
networkx.algorithms.flow.gomory_hu (2 missing, 0 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
func |
networkx.algorithms.gomory_hu_tree |
4 | 3 | 0 |
func |
networkx.algorithms.flow.gomory_hu.gomory_hu_tree |
4 | 3 | 0 |
networkx.algorithms.flow.maxflow (16 missing, 0 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
func |
networkx.algorithms.minimum_cut |
7 | 5 | 0 |
func |
networkx.algorithms.minimum_cut_value |
7 | 5 | 0 |
func |
networkx.algorithms.maximum_flow |
7 | 5 | 0 |
func |
networkx.algorithms.maximum_flow_value |
7 | 5 | 0 |
func |
networkx.algorithms.flow.maxflow.maximum_flow_value |
7 | 5 | 0 |
func |
networkx.algorithms.flow.maxflow.minimum_cut |
7 | 5 | 0 |
func |
networkx.algorithms.flow.maxflow.maximum_flow |
7 | 5 | 0 |
func |
networkx.algorithms.flow.maxflow.minimum_cut_value |
7 | 5 | 0 |
networkx.algorithms.flow.preflowpush (1 missing, 0 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
func |
networkx.algorithms.flow.preflowpush.preflow_push |
8 | 7 | 0 |
networkx.algorithms.flow.shortestaugmentingpath (1 missing, 0 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
func |
networkx.algorithms.flow.shortestaugmentingpath.shortest_augmenting_path |
9 | 8 | 0 |
networkx.algorithms.flow.utils (19 missing, 2 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
func |
networkx.algorithms.flow.build_residual_network |
5 | 2 | 0 |
func |
networkx.algorithms.flow.build_flow_dict |
3 | 1 | 0 |
func |
networkx.algorithms.flow.utils.detect_unboundedness |
4 | 1 | 0 |
func |
networkx.algorithms.flow.utils.build_residual_network |
5 | 2 | 0 |
func |
networkx.algorithms.flow.utils.build_flow_dict |
3 | 1 | 0 |
meth |
CurrentEdge.init |
2 | 1 | 0 |
meth |
CurrentEdge.get |
1 | 0 | 0 |
attr |
Level.active |
1 | 1 | 1 |
attr |
Level.inactive |
1 | 1 | 1 |
meth |
GlobalRelabelThreshold.init |
4 | 1 | 0 |
meth |
GlobalRelabelThreshold.add_work |
2 | 1 | 0 |
networkx.algorithms.hybrid (1 missing, 0 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
func |
networkx.algorithms.hybrid.kl_connected_subgraph |
6 | 5 | 0 |
networkx.algorithms.isolate (1 missing, 0 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
func |
networkx.algorithms.isolate.isolates |
2 | 1 | 0 |
networkx.algorithms.isomorphism.ismags (10 missing, 2 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
meth |
ISMAGS.init |
6 | 1 | 0 |
meth |
ISMAGS.create_aligned_partitions |
4 | 0 | 0 |
meth |
ISMAGS.subgraph_isomorphisms_iter |
2 | 1 | 0 |
attr |
ISMAGS.graph |
1 | 1 | 1 |
attr |
ISMAGS.subgraph |
1 | 1 | 1 |
networkx.algorithms.isomorphism.isomorphvf2 (15 missing, 20 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
meth |
DiGraphMatcher.init |
3 | 1 | 0 |
meth |
DiGraphMatcher.syntactic_feasibility |
3 | 0 | 0 |
attr |
DiGraphMatcher.core_1 |
1 | 1 | 1 |
attr |
DiGraphMatcher.core_2 |
1 | 1 | 1 |
attr |
DiGraphMatcher.in_1 |
1 | 1 | 1 |
attr |
DiGraphMatcher.in_2 |
1 | 1 | 1 |
attr |
DiGraphMatcher.out_1 |
1 | 1 | 1 |
attr |
DiGraphMatcher.out_2 |
1 | 1 | 1 |
attr |
DiGraphMatcher.state |
1 | 1 | 1 |
attr |
DiGraphMatcher.mapping |
1 | 1 | 1 |
meth |
GraphMatcher.init |
3 | 1 | 0 |
meth |
GraphMatcher.semantic_feasibility |
3 | 0 | 0 |
meth |
GraphMatcher.subgraph_is_isomorphic |
1 | 0 | 0 |
meth |
GraphMatcher.subgraph_is_monomorphic |
1 | 0 | 0 |
meth |
GraphMatcher.syntactic_feasibility |
3 | 0 | 0 |
attr |
GraphMatcher.G1 |
1 | 1 | 1 |
attr |
GraphMatcher.G2 |
1 | 1 | 1 |
attr |
GraphMatcher.G1_nodes |
1 | 1 | 1 |
attr |
GraphMatcher.G2_nodes |
1 | 1 | 1 |
attr |
GraphMatcher.G2_node_order |
1 | 1 | 1 |
attr |
GraphMatcher.old_recursion_limit |
1 | 1 | 1 |
attr |
GraphMatcher.core_1 |
1 | 1 | 1 |
attr |
GraphMatcher.core_2 |
1 | 1 | 1 |
attr |
GraphMatcher.inout_1 |
1 | 1 | 1 |
attr |
GraphMatcher.inout_2 |
1 | 1 | 1 |
attr |
GraphMatcher.state |
1 | 1 | 1 |
attr |
GraphMatcher.mapping |
1 | 1 | 1 |
networkx.algorithms.isomorphism.matchhelpers (20 missing, 3 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
func |
networkx.algorithms.isomorphism.matchhelpers.categorical_node_match |
3 | 0 | 0 |
func |
networkx.algorithms.isomorphism.matchhelpers.numerical_node_match |
5 | 2 | 0 |
attr |
networkx.algorithms.isomorphism.matchhelpers.numerical_edge_match |
1 | 1 | 1 |
attr |
networkx.algorithms.isomorphism.matchhelpers.generic_edge_match |
1 | 1 | 1 |
func |
networkx.algorithms.isomorphism.matchhelpers.numerical_multiedge_match |
5 | 2 | 0 |
func |
networkx.algorithms.isomorphism.matchhelpers.generic_node_match |
4 | 0 | 0 |
func |
networkx.algorithms.isomorphism.matchhelpers.generic_multiedge_match |
4 | 0 | 0 |
func |
networkx.algorithms.isomorphism.matchhelpers.categorical_multiedge_match |
3 | 0 | 0 |
attr |
networkx.algorithms.isomorphism.matchhelpers.categorical_edge_match |
1 | 1 | 1 |
networkx.algorithms.isomorphism.temporalisomorphvf2 (65 missing, 4 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
meth |
TimeRespectingGraphMatcher.init |
5 | 1 | 0 |
meth |
TimeRespectingGraphMatcher.one_hop |
4 | 0 | 0 |
meth |
TimeRespectingGraphMatcher.two_hop |
5 | 0 | 0 |
meth |
TimeRespectingGraphMatcher.semantic_feasibility |
3 | 0 | 0 |
attr |
TimeRespectingGraphMatcher.temporal_attribute_name |
1 | 1 | 1 |
attr |
TimeRespectingGraphMatcher.delta |
1 | 1 | 1 |
meth |
TimeRespectingDiGraphMatcher.init |
5 | 1 | 0 |
meth |
TimeRespectingDiGraphMatcher.get_pred_dates |
5 | 0 | 0 |
meth |
TimeRespectingDiGraphMatcher.get_succ_dates |
5 | 0 | 0 |
meth |
TimeRespectingDiGraphMatcher.one_hop |
6 | 0 | 0 |
meth |
TimeRespectingDiGraphMatcher.two_hop_pred |
5 | 0 | 0 |
meth |
TimeRespectingDiGraphMatcher.two_hop_succ |
5 | 0 | 0 |
meth |
TimeRespectingDiGraphMatcher.preds |
5 | 0 | 0 |
meth |
TimeRespectingDiGraphMatcher.succs |
5 | 0 | 0 |
meth |
TimeRespectingDiGraphMatcher.test_one |
3 | 0 | 0 |
meth |
TimeRespectingDiGraphMatcher.test_two |
3 | 0 | 0 |
meth |
TimeRespectingDiGraphMatcher.semantic_feasibility |
3 | 0 | 0 |
attr |
TimeRespectingDiGraphMatcher.temporal_attribute_name |
1 | 1 | 1 |
attr |
TimeRespectingDiGraphMatcher.delta |
1 | 1 | 1 |
networkx.algorithms.isomorphism.tree_isomorphism (4 missing, 0 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
func |
networkx.algorithms.isomorphism.tree_isomorphism.rooted_tree_isomorphism |
5 | 1 | 0 |
networkx.algorithms.isomorphism.vf2pp (2 missing, 0 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
func |
networkx.algorithms.isomorphism.vf2pp.vf2pp_is_isomorphic |
5 | 4 | 0 |
func |
networkx.algorithms.isomorphism.vf2pp.vf2pp_isomorphism |
5 | 4 | 0 |
networkx.algorithms.isomorphism.vf2userfunc (11 missing, 9 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
meth |
DiGraphMatcher.init |
5 | 1 | 0 |
meth |
DiGraphMatcher.semantic_feasibility |
3 | 0 | 0 |
attr |
DiGraphMatcher.node_match |
1 | 1 | 1 |
attr |
DiGraphMatcher.edge_match |
1 | 1 | 1 |
attr |
DiGraphMatcher.G1_adj |
1 | 1 | 1 |
attr |
DiGraphMatcher.G2_adj |
1 | 1 | 1 |
meth |
GraphMatcher.init |
5 | 1 | 0 |
attr |
GraphMatcher.node_match |
1 | 1 | 1 |
attr |
GraphMatcher.edge_match |
1 | 1 | 1 |
attr |
GraphMatcher.G1_adj |
1 | 1 | 1 |
attr |
GraphMatcher.G2_adj |
1 | 1 | 1 |
attr |
GraphMatcher.semantic_feasibility |
1 | 1 | 1 |
networkx.algorithms.link_prediction (17 missing, 0 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
func |
networkx.algorithms.link_prediction.jaccard_coefficient |
3 | 1 | 0 |
func |
networkx.algorithms.link_prediction.preferential_attachment |
3 | 1 | 0 |
func |
networkx.algorithms.link_prediction.resource_allocation_index |
3 | 1 | 0 |
func |
networkx.algorithms.link_prediction.within_inter_cluster |
5 | 3 | 0 |
func |
networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft |
4 | 2 | 0 |
func |
networkx.algorithms.link_prediction.cn_soundarajan_hopcroft |
4 | 2 | 0 |
func |
networkx.algorithms.link_prediction.common_neighbor_centrality |
4 | 1 | 0 |
func |
networkx.algorithms.link_prediction.adamic_adar_index |
3 | 1 | 0 |
networkx.algorithms.lowest_common_ancestors (7 missing, 0 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
func |
networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor |
5 | 1 | 0 |
func |
networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor |
3 | 1 | 0 |
func |
networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor |
4 | 3 | 0 |
networkx.algorithms.minors.contraction (14 missing, 0 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
func |
networkx.algorithms.minors.quotient_graph |
9 | 6 | 0 |
func |
networkx.algorithms.minors.contracted_edge |
6 | 5 | 0 |
func |
networkx.algorithms.minors.contracted_nodes |
7 | 4 | 0 |
func |
networkx.algorithms.minors.contraction.quotient_graph |
9 | 6 | 0 |
func |
networkx.algorithms.minors.contraction.contracted_edge |
6 | 5 | 0 |
func |
networkx.algorithms.minors.contraction.contracted_nodes |
7 | 4 | 0 |
networkx.algorithms.moral (1 missing, 0 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
func |
networkx.algorithms.moral.moral_graph |
2 | 1 | 0 |
networkx.algorithms.node_classification (2 missing, 0 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
func |
networkx.algorithms.node_classification.harmonic_function |
4 | 3 | 0 |
func |
networkx.algorithms.node_classification.local_and_global_consistency |
5 | 4 | 0 |
networkx.algorithms.operators.all (4 missing, 0 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
func |
networkx.algorithms.operators.all.compose_all |
2 | 1 | 0 |
func |
networkx.algorithms.operators.all.intersection_all |
2 | 1 | 0 |
func |
networkx.algorithms.operators.all.disjoint_union_all |
2 | 1 | 0 |
func |
networkx.algorithms.operators.all.union_all |
3 | 2 | 0 |
networkx.algorithms.operators.binary (7 missing, 0 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
func |
networkx.algorithms.operators.binary.symmetric_difference |
3 | 2 | 0 |
func |
networkx.algorithms.operators.binary.disjoint_union |
3 | 2 | 0 |
func |
networkx.algorithms.operators.binary.difference |
3 | 2 | 0 |
func |
networkx.algorithms.operators.binary.intersection |
3 | 2 | 0 |
func |
networkx.algorithms.operators.binary.full_join |
4 | 1 | 0 |
networkx.algorithms.operators.product (3 missing, 0 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
func |
networkx.algorithms.operators.product.modular_product |
3 | 2 | 0 |
func |
networkx.algorithms.operators.product.power |
3 | 1 | 0 |
networkx.algorithms.operators.unary (1 missing, 0 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
func |
networkx.algorithms.operators.unary.complement |
2 | 1 | 0 |
networkx.algorithms.planar_drawing (1 missing, 0 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
func |
networkx.algorithms.planar_drawing.combinatorial_embedding_to_pos |
3 | 2 | 0 |
networkx.algorithms.planarity (2 missing, 0 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
meth |
PlanarEmbedding.add_half_edge |
5 | 4 | 0 |
func |
networkx.algorithms.planarity.check_planarity |
3 | 2 | 0 |
networkx.algorithms.polynomials (2 missing, 0 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
func |
networkx.algorithms.polynomials.tutte_polynomial |
2 | 1 | 0 |
func |
networkx.algorithms.polynomials.chromatic_polynomial |
2 | 1 | 0 |
networkx.algorithms.reciprocity (1 missing, 0 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
func |
networkx.algorithms.reciprocity.overall_reciprocity |
2 | 1 | 0 |
networkx.algorithms.regular (3 missing, 0 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
func |
networkx.algorithms.regular.is_k_regular |
3 | 2 | 0 |
func |
networkx.algorithms.regular.k_factor |
4 | 2 | 0 |
networkx.algorithms.shortest_paths.dense (1 missing, 0 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
func |
networkx.algorithms.shortest_paths.dense.floyd_warshall_numpy |
4 | 3 | 0 |
networkx.algorithms.shortest_paths.generic (2 missing, 0 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
func |
networkx.algorithms.shortest_paths.generic.shortest_path |
8 | 7 | 0 |
func |
networkx.algorithms.shortest_paths.generic.shortest_path_length |
8 | 7 | 0 |
networkx.algorithms.shortest_paths.unweighted (2 missing, 0 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
func |
networkx.algorithms.shortest_paths.unweighted.predecessor |
6 | 5 | 0 |
func |
networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length |
4 | 3 | 0 |
networkx.algorithms.similarity (4 missing, 0 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
func |
networkx.algorithms.similarity.graph_edit_distance |
14 | 12 | 0 |
func |
networkx.algorithms.similarity.optimal_edit_paths |
12 | 11 | 0 |
func |
networkx.algorithms.similarity.optimize_edit_paths |
15 | 14 | 0 |
networkx.algorithms.smallworld (3 missing, 0 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
func |
networkx.algorithms.smallworld.random_reference |
5 | 4 | 0 |
func |
networkx.algorithms.smallworld.lattice_reference |
6 | 4 | 0 |
networkx.algorithms.sparsifiers (1 missing, 0 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
func |
networkx.algorithms.sparsifiers.spanner |
5 | 4 | 0 |
networkx.algorithms.summarization (4 missing, 0 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
func |
networkx.algorithms.summarization.dedensify |
5 | 3 | 0 |
func |
networkx.algorithms.summarization.snap_aggregation |
7 | 5 | 0 |
networkx.algorithms.swap (2 missing, 0 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
func |
networkx.algorithms.swap.double_edge_swap |
5 | 4 | 0 |
func |
networkx.algorithms.swap.directed_edge_swap |
5 | 4 | 0 |
networkx.algorithms.threshold (1 missing, 0 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
func |
networkx.algorithms.threshold.find_threshold_graph |
3 | 2 | 0 |
networkx.algorithms.time_dependent (2 missing, 0 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
func |
networkx.algorithms.time_dependent.cd_index |
6 | 4 | 0 |
networkx.algorithms.tournament (1 missing, 0 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
func |
networkx.algorithms.tournament.tournament_matrix |
2 | 1 | 0 |
networkx.algorithms.tree.branchings (19 missing, 12 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
meth |
ArborescenceIterator.init |
5 | 4 | 0 |
meth |
ArborescenceIterator.next |
1 | 0 | 0 |
attr |
ArborescenceIterator.G |
1 | 1 | 1 |
attr |
ArborescenceIterator.weight |
1 | 1 | 1 |
attr |
ArborescenceIterator.minimum |
1 | 1 | 1 |
attr |
ArborescenceIterator.method |
1 | 1 | 1 |
attr |
ArborescenceIterator.init_partition |
1 | 1 | 1 |
attr |
ArborescenceIterator.partition_queue |
1 | 1 | 1 |
func |
networkx.algorithms.maximum_branching |
6 | 5 | 0 |
func |
networkx.algorithms.maximum_spanning_arborescence |
6 | 5 | 0 |
func |
networkx.algorithms.minimum_spanning_arborescence |
6 | 5 | 0 |
func |
networkx.algorithms.minimum_branching |
6 | 5 | 0 |
func |
networkx.algorithms.tree.branchings.greedy_branching |
6 | 5 | 0 |
func |
networkx.algorithms.tree.branchings.minimal_branching |
6 | 1 | 0 |
func |
networkx.algorithms.tree.branchings.maximum_spanning_arborescence |
6 | 5 | 0 |
meth |
ArborescenceIterator.init |
5 | 4 | 0 |
meth |
ArborescenceIterator.next |
1 | 0 | 0 |
attr |
ArborescenceIterator.G |
1 | 1 | 1 |
attr |
ArborescenceIterator.weight |
1 | 1 | 1 |
attr |
ArborescenceIterator.minimum |
1 | 1 | 1 |
attr |
ArborescenceIterator.method |
1 | 1 | 1 |
attr |
ArborescenceIterator.init_partition |
1 | 1 | 1 |
attr |
ArborescenceIterator.partition_queue |
1 | 1 | 1 |
func |
networkx.algorithms.tree.branchings.branching_weight |
4 | 3 | 0 |
func |
networkx.algorithms.tree.branchings.minimum_spanning_arborescence |
6 | 5 | 0 |
func |
networkx.algorithms.tree.branchings.minimum_branching |
6 | 5 | 0 |
func |
networkx.algorithms.tree.branchings.maximum_branching |
6 | 5 | 0 |
networkx.algorithms.tree.coding (3 missing, 0 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
func |
networkx.algorithms.tree.coding.from_nested_tuple |
3 | 2 | 0 |
func |
networkx.algorithms.tree.coding.to_nested_tuple |
4 | 3 | 0 |
func |
networkx.algorithms.tree.coding.from_prufer_sequence |
2 | 1 | 0 |
networkx.algorithms.tree.mst (10 missing, 5 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
func |
networkx.algorithms.tree.mst.maximum_spanning_edges |
7 | 6 | 0 |
func |
networkx.algorithms.tree.mst.number_of_spanning_trees |
4 | 2 | 0 |
func |
networkx.algorithms.tree.mst.random_spanning_tree |
5 | 3 | 0 |
func |
networkx.algorithms.tree.mst.minimum_spanning_tree |
5 | 4 | 0 |
meth |
SpanningTreeIterator.next |
1 | 0 | 0 |
attr |
SpanningTreeIterator.G |
1 | 1 | 1 |
attr |
SpanningTreeIterator.weight |
1 | 1 | 1 |
attr |
SpanningTreeIterator.minimum |
1 | 1 | 1 |
attr |
SpanningTreeIterator.ignore_nan |
1 | 1 | 1 |
attr |
SpanningTreeIterator.partition_queue |
1 | 1 | 1 |
func |
networkx.algorithms.tree.mst.partition_spanning_tree |
6 | 5 | 0 |
func |
networkx.algorithms.tree.mst.minimum_spanning_edges |
7 | 6 | 0 |
func |
networkx.algorithms.tree.mst.maximum_spanning_tree |
5 | 4 | 0 |
networkx.algorithms.tree.operations (1 missing, 0 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
func |
networkx.algorithms.tree.operations.join_trees |
4 | 3 | 0 |
networkx.algorithms.vitality (1 missing, 0 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
func |
networkx.algorithms.vitality.closeness_vitality |
5 | 4 | 0 |
networkx.algorithms.walks (1 missing, 0 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
func |
networkx.algorithms.walks.number_of_walks |
3 | 2 | 0 |
networkx.algorithms.wiener (3 missing, 0 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
func |
networkx.algorithms.wiener.hyper_wiener_index |
3 | 2 | 0 |
func |
networkx.algorithms.wiener.gutman_index |
3 | 2 | 0 |
func |
networkx.algorithms.wiener.schultz_index |
3 | 2 | 0 |
networkx.classes.coreviews (2 missing, 0 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
meth |
FilterAdjacency.len |
1 | 0 | 0 |
meth |
FilterAdjacency.iter |
1 | 0 | 0 |
networkx.classes.filters (23 missing, 1 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
func |
networkx.classes.filters.hide_multidiedges |
2 | 0 | 0 |
func |
networkx.classes.filters.show_edges |
2 | 0 | 0 |
func |
networkx.classes.filters.show_diedges |
2 | 0 | 0 |
func |
networkx.classes.filters.hide_diedges |
2 | 0 | 0 |
func |
networkx.classes.filters.show_multiedges |
2 | 0 | 0 |
func |
networkx.classes.filters.hide_nodes |
2 | 0 | 0 |
func |
networkx.classes.filters.hide_edges |
2 | 0 | 0 |
func |
networkx.classes.filters.hide_multiedges |
2 | 0 | 0 |
func |
networkx.classes.filters.show_multidiedges |
2 | 0 | 0 |
meth |
show_nodes.init |
2 | 1 | 0 |
meth |
show_nodes.call |
2 | 0 | 0 |
attr |
show_nodes.nodes |
1 | 1 | 1 |
func |
networkx.classes.filters.no_filter |
2 | 0 | 0 |
networkx.classes.function (46 missing, 0 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
func |
networkx.classes.function.remove_edge_attributes |
4 | 2 | 0 |
func |
networkx.classes.function.add_path |
4 | 1 | 0 |
func |
networkx.classes.function.nodes |
2 | 1 | 0 |
func |
networkx.classes.function.number_of_edges |
2 | 1 | 0 |
func |
networkx.classes.function.subgraph |
3 | 1 | 0 |
func |
networkx.classes.function.to_undirected |
2 | 0 | 0 |
func |
networkx.classes.function.set_edge_attributes |
6 | 4 | 0 |
func |
networkx.classes.function.remove_node_attributes |
4 | 2 | 0 |
func |
networkx.classes.function.set_node_attributes |
6 | 4 | 0 |
func |
networkx.classes.function.add_cycle |
4 | 1 | 0 |
func |
networkx.classes.function.restricted_view |
4 | 1 | 0 |
func |
networkx.classes.function.path_weight |
4 | 2 | 0 |
func |
networkx.classes.function.create_empty_copy |
3 | 2 | 0 |
func |
networkx.classes.function.to_directed |
2 | 0 | 0 |
func |
networkx.classes.function.density |
2 | 1 | 0 |
func |
networkx.classes.function.get_edge_attributes |
4 | 3 | 0 |
func |
networkx.classes.function.edge_subgraph |
3 | 1 | 0 |
func |
networkx.classes.function.number_of_nodes |
2 | 1 | 0 |
func |
networkx.classes.function.get_node_attributes |
4 | 3 | 0 |
func |
networkx.classes.function.neighbors |
3 | 1 | 0 |
func |
networkx.classes.function.freeze |
2 | 1 | 0 |
func |
networkx.classes.function.degree |
4 | 1 | 0 |
func |
networkx.classes.function.selfloop_edges |
5 | 4 | 0 |
func |
networkx.classes.function.edges |
3 | 1 | 0 |
func |
networkx.classes.function.add_star |
4 | 1 | 0 |
networkx.classes.graph (6 missing, 14 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
meth |
Graph.new |
4 | 1 | 0 |
meth |
Graph.init |
3 | 3 | 1 |
meth |
Graph.add_node |
3 | 3 | 1 |
meth |
Graph.add_nodes_from |
3 | 3 | 1 |
meth |
Graph.add_edge |
4 | 4 | 1 |
meth |
Graph.add_edges_from |
3 | 3 | 1 |
meth |
Graph.add_weighted_edges_from |
4 | 4 | 1 |
meth |
Graph.get_edge_data |
4 | 4 | 1 |
meth |
Graph.new |
4 | 1 | 0 |
meth |
Graph.init |
3 | 3 | 1 |
meth |
Graph.add_node |
3 | 3 | 1 |
meth |
Graph.add_nodes_from |
3 | 3 | 1 |
meth |
Graph.add_edge |
4 | 4 | 1 |
meth |
Graph.add_edges_from |
3 | 3 | 1 |
meth |
Graph.add_weighted_edges_from |
4 | 4 | 1 |
meth |
Graph.get_edge_data |
4 | 4 | 1 |
networkx.classes.multigraph (8 missing, 2 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
meth |
MultiGraph.new |
4 | 1 | 0 |
meth |
MultiGraph.init |
4 | 3 | 1 |
meth |
MultiGraph.new |
4 | 1 | 0 |
meth |
MultiGraph.init |
4 | 3 | 1 |
networkx.classes.reportviews (6 missing, 0 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
meth |
NodeDataView.init |
4 | 3 | 0 |
meth |
NodeDataView.getitem |
2 | 1 | 0 |
meth |
OutEdgeDataView.init |
5 | 3 | 0 |
meth |
OutMultiEdgeDataView.init |
6 | 4 | 0 |
networkx.convert (8 missing, 0 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
func |
networkx.convert.to_edgelist |
3 | 2 | 0 |
func |
networkx.convert.from_dict_of_lists |
3 | 2 | 0 |
func |
networkx.convert.to_dict_of_dicts |
4 | 3 | 0 |
func |
networkx.convert.from_dict_of_dicts |
4 | 1 | 0 |
func |
networkx.convert.from_edgelist |
3 | 1 | 0 |
networkx.convert_matrix (10 missing, 4 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
func |
networkx.convert_matrix.from_pandas_edgelist |
7 | 7 | 1 |
func |
networkx.convert_matrix.from_pandas_adjacency |
3 | 3 | 1 |
func |
networkx.convert_matrix.to_scipy_sparse_array |
6 | 1 | 0 |
func |
networkx.convert_matrix.from_scipy_sparse_array |
5 | 0 | 0 |
func |
networkx.convert_matrix.to_pandas_edgelist |
7 | 7 | 1 |
func |
networkx.convert_matrix.to_pandas_adjacency |
8 | 8 | 1 |
networkx.exception (3 missing, 0 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
meth |
PowerIterationFailedConvergence.init |
4 | 1 | 0 |
networkx.generators.atlas (1 missing, 0 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
func |
networkx.generators.atlas.graph_atlas |
2 | 1 | 0 |
networkx.generators.classic (64 missing, 0 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
func |
networkx.generators.classic.ladder_graph |
3 | 0 | 0 |
func |
networkx.generators.classic.complete_multipartite_graph |
2 | 0 | 0 |
func |
networkx.generators.classic.tadpole_graph |
4 | 1 | 0 |
func |
networkx.generators.classic.dorogovtsev_goltsev_mendes_graph |
3 | 0 | 0 |
func |
networkx.generators.classic.lollipop_graph |
4 | 0 | 0 |
func |
networkx.generators.classic.cycle_graph |
3 | 0 | 0 |
func |
networkx.generators.classic.kneser_graph |
3 | 1 | 0 |
func |
networkx.generators.classic.full_rary_tree |
4 | 0 | 0 |
func |
networkx.generators.classic.trivial_graph |
2 | 0 | 0 |
func |
networkx.generators.classic.binomial_tree |
3 | 0 | 0 |
func |
networkx.generators.classic.turan_graph |
3 | 0 | 0 |
func |
networkx.generators.classic.circulant_graph |
4 | 0 | 0 |
func |
networkx.generators.classic.star_graph |
3 | 0 | 0 |
func |
networkx.generators.classic.wheel_graph |
3 | 0 | 0 |
func |
networkx.generators.classic.empty_graph |
4 | 1 | 0 |
func |
networkx.generators.classic.null_graph |
2 | 0 | 0 |
func |
networkx.generators.classic.circular_ladder_graph |
3 | 0 | 0 |
func |
networkx.generators.classic.complete_graph |
3 | 0 | 0 |
func |
networkx.generators.classic.barbell_graph |
4 | 0 | 0 |
func |
networkx.generators.classic.balanced_tree |
4 | 0 | 0 |
func |
networkx.generators.classic.path_graph |
3 | 0 | 0 |
networkx.generators.cographs (3 missing, 0 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
func |
networkx.generators.cographs.random_cograph |
3 | 0 | 0 |
networkx.generators.community (50 missing, 0 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
func |
networkx.generators.community.planted_partition_graph |
7 | 1 | 0 |
func |
networkx.generators.community.random_partition_graph |
6 | 1 | 0 |
func |
networkx.generators.community.stochastic_block_model |
8 | 4 | 0 |
func |
networkx.generators.community.relaxed_caveman_graph |
5 | 0 | 0 |
func |
networkx.generators.community.connected_caveman_graph |
3 | 0 | 0 |
func |
networkx.generators.community.ring_of_cliques |
3 | 0 | 0 |
func |
networkx.generators.community.windmill_graph |
3 | 0 | 0 |
func |
networkx.generators.community.LFR_benchmark_graph |
13 | 2 | 0 |
func |
networkx.generators.community.caveman_graph |
3 | 0 | 0 |
func |
networkx.generators.community.gaussian_random_partition_graph |
8 | 1 | 0 |
networkx.generators.degree_seq (20 missing, 0 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
func |
networkx.generators.degree_seq.directed_configuration_model |
5 | 1 | 0 |
func |
networkx.generators.degree_seq.configuration_model |
4 | 1 | 0 |
func |
networkx.generators.degree_seq.havel_hakimi_graph |
3 | 0 | 0 |
func |
networkx.generators.degree_seq.directed_havel_hakimi_graph |
4 | 1 | 0 |
func |
networkx.generators.degree_seq.expected_degree_graph |
4 | 2 | 0 |
func |
networkx.generators.degree_seq.random_degree_sequence_graph |
4 | 2 | 0 |
func |
networkx.generators.degree_seq.degree_sequence_tree |
3 | 0 | 0 |
networkx.generators.directed (23 missing, 0 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
func |
networkx.generators.directed.gnr_graph |
5 | 0 | 0 |
func |
networkx.generators.directed.scale_free_graph |
10 | 5 | 0 |
func |
networkx.generators.directed.gnc_graph |
4 | 0 | 0 |
func |
networkx.generators.directed.random_k_out_graph |
6 | 2 | 0 |
func |
networkx.generators.directed.gn_graph |
5 | 0 | 0 |
networkx.generators.duplication (9 missing, 0 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
func |
networkx.generators.duplication.duplication_divergence_graph |
4 | 1 | 0 |
func |
networkx.generators.duplication.partial_duplication_graph |
6 | 0 | 0 |
networkx.generators.ego (3 missing, 0 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
func |
networkx.generators.ego.ego_graph |
7 | 4 | 0 |
networkx.generators.expanders (26 missing, 0 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
func |
networkx.generators.expanders.paley_graph |
3 | 0 | 0 |
func |
networkx.generators.expanders.random_regular_expander_graph |
7 | 0 | 0 |
func |
networkx.generators.expanders.margulis_gabber_galil_graph |
3 | 0 | 0 |
func |
networkx.generators.expanders.chordal_cycle_graph |
3 | 0 | 0 |
func |
networkx.generators.expanders.maybe_regular_expander |
6 | 1 | 0 |
func |
networkx.generators.expanders.maybe_regular_expander_graph |
6 | 1 | 0 |
networkx.generators.geometric (42 missing, 0 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
func |
networkx.generators.geometric.navigable_small_world_graph |
7 | 4 | 0 |
func |
networkx.generators.geometric.soft_random_geometric_graph |
8 | 2 | 0 |
func |
networkx.generators.geometric.geometric_soft_configuration_graph |
7 | 1 | 0 |
func |
networkx.generators.geometric.geographical_threshold_graph |
9 | 1 | 0 |
func |
networkx.generators.geometric.waxman_graph |
8 | 3 | 0 |
func |
networkx.generators.geometric.thresholded_random_geometric_graph |
9 | 2 | 0 |
func |
networkx.generators.geometric.random_geometric_graph |
7 | 2 | 0 |
func |
networkx.generators.geometric.geometric_edges |
4 | 2 | 0 |
networkx.generators.harary_graph (8 missing, 0 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
func |
networkx.generators.harary_graph.hnm_harary_graph |
4 | 0 | 0 |
func |
networkx.generators.harary_graph.hkn_harary_graph |
4 | 0 | 0 |
networkx.generators.internet_as_graphs (3 missing, 0 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
func |
networkx.generators.internet_as_graphs.random_internet_as_graph |
3 | 0 | 0 |
networkx.generators.intersection (15 missing, 0 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
func |
networkx.generators.intersection.general_random_intersection_graph |
5 | 0 | 0 |
func |
networkx.generators.intersection.k_random_intersection_graph |
5 | 0 | 0 |
func |
networkx.generators.intersection.uniform_random_intersection_graph |
5 | 0 | 0 |
networkx.generators.interval_graph (2 missing, 0 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
func |
networkx.generators.interval_graph.interval_graph |
2 | 0 | 0 |
networkx.generators.lattice (16 missing, 0 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
func |
networkx.generators.lattice.grid_graph |
3 | 1 | 0 |
func |
networkx.generators.lattice.hypercube_graph |
2 | 0 | 0 |
func |
networkx.generators.lattice.grid_2d_graph |
5 | 1 | 0 |
func |
networkx.generators.lattice.hexagonal_lattice_graph |
6 | 2 | 0 |
func |
networkx.generators.lattice.triangular_lattice_graph |
6 | 2 | 0 |
networkx.generators.line (3 missing, 0 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
func |
networkx.generators.line.line_graph |
3 | 1 | 0 |
func |
networkx.generators.line.inverse_line_graph |
2 | 1 | 0 |
networkx.generators.mycielski (3 missing, 0 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
func |
networkx.generators.mycielski.mycielskian |
3 | 2 | 0 |
func |
networkx.generators.mycielski.mycielski_graph |
2 | 0 | 0 |
networkx.generators.nonisomorphic_trees (3 missing, 0 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
func |
networkx.generators.nonisomorphic_trees.number_of_nonisomorphic_trees |
2 | 0 | 0 |
func |
networkx.generators.nonisomorphic_trees.nonisomorphic_trees |
2 | 1 | 0 |
networkx.generators.random_graphs (96 missing, 0 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
func |
networkx.generators.random_graphs.extended_barabasi_albert_graph |
7 | 1 | 0 |
func |
networkx.generators.random_graphs.newman_watts_strogatz_graph |
6 | 0 | 0 |
func |
networkx.generators.random_graphs.gnm_random_graph |
6 | 1 | 0 |
func |
networkx.generators.random_graphs.watts_strogatz_graph |
6 | 0 | 0 |
func |
networkx.generators.random_graphs.random_lobster |
6 | 0 | 0 |
func |
networkx.generators.random_graphs.random_powerlaw_tree |
6 | 2 | 0 |
func |
networkx.generators.random_graphs.connected_watts_strogatz_graph |
7 | 1 | 0 |
func |
networkx.generators.random_graphs.powerlaw_cluster_graph |
6 | 0 | 0 |
func |
networkx.generators.random_graphs.random_lobster_graph |
6 | 0 | 0 |
func |
networkx.generators.random_graphs.fast_gnp_random_graph |
6 | 1 | 0 |
func |
networkx.generators.random_graphs.random_kernel_graph |
6 | 0 | 0 |
func |
networkx.generators.random_graphs.dual_barabasi_albert_graph |
8 | 1 | 0 |
func |
networkx.generators.random_graphs.dense_gnm_random_graph |
5 | 0 | 0 |
func |
networkx.generators.random_graphs.gnp_random_graph |
6 | 1 | 0 |
func |
networkx.generators.random_graphs.random_regular_graph |
5 | 0 | 0 |
func |
networkx.generators.random_graphs.barabasi_albert_graph |
6 | 1 | 0 |
func |
networkx.generators.random_graphs.random_shell_graph |
4 | 0 | 0 |
func |
networkx.generators.random_graphs.random_powerlaw_tree_sequence |
5 | 2 | 0 |
networkx.generators.small (49 missing, 0 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
func |
networkx.generators.small.house_graph |
2 | 0 | 0 |
func |
networkx.generators.small.octahedral_graph |
2 | 0 | 0 |
func |
networkx.generators.small.diamond_graph |
2 | 0 | 0 |
func |
networkx.generators.small.truncated_tetrahedron_graph |
2 | 0 | 0 |
func |
networkx.generators.small.pappus_graph |
1 | 0 | 0 |
func |
networkx.generators.small.generalized_petersen_graph |
4 | 2 | 0 |
func |
networkx.generators.small.desargues_graph |
2 | 0 | 0 |
func |
networkx.generators.small.bull_graph |
2 | 0 | 0 |
func |
networkx.generators.small.truncated_cube_graph |
2 | 0 | 0 |
func |
networkx.generators.small.frucht_graph |
2 | 0 | 0 |
func |
networkx.generators.small.moebius_kantor_graph |
2 | 0 | 0 |
func |
networkx.generators.small.LCF_graph |
5 | 0 | 0 |
func |
networkx.generators.small.chvatal_graph |
2 | 0 | 0 |
func |
networkx.generators.small.heawood_graph |
2 | 0 | 0 |
func |
networkx.generators.small.tutte_graph |
2 | 0 | 0 |
func |
networkx.generators.small.dodecahedral_graph |
2 | 0 | 0 |
func |
networkx.generators.small.krackhardt_kite_graph |
2 | 0 | 0 |
func |
networkx.generators.small.petersen_graph |
2 | 0 | 0 |
func |
networkx.generators.small.sedgewick_maze_graph |
2 | 0 | 0 |
func |
networkx.generators.small.hoffman_singleton_graph |
1 | 0 | 0 |
func |
networkx.generators.small.house_x_graph |
2 | 0 | 0 |
func |
networkx.generators.small.cubical_graph |
2 | 0 | 0 |
func |
networkx.generators.small.icosahedral_graph |
2 | 0 | 0 |
func |
networkx.generators.small.tetrahedral_graph |
2 | 0 | 0 |
networkx.generators.social (4 missing, 0 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
func |
networkx.generators.social.les_miserables_graph |
1 | 0 | 0 |
func |
networkx.generators.social.karate_club_graph |
1 | 0 | 0 |
func |
networkx.generators.social.davis_southern_women_graph |
1 | 0 | 0 |
func |
networkx.generators.social.florentine_families_graph |
1 | 0 | 0 |
networkx.generators.spectral_graph_forge (2 missing, 0 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
func |
networkx.generators.spectral_graph_forge.spectral_graph_forge |
5 | 3 | 0 |
networkx.generators.stochastic (1 missing, 0 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
func |
networkx.generators.stochastic.stochastic_graph |
4 | 3 | 0 |
networkx.generators.sudoku (1 missing, 0 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
func |
networkx.generators.sudoku.sudoku_graph |
2 | 1 | 0 |
networkx.generators.time_series (2 missing, 0 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
func |
networkx.generators.time_series.visibility_graph |
2 | 0 | 0 |
networkx.generators.trees (21 missing, 0 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
func |
networkx.generators.trees.prefix_tree |
2 | 1 | 0 |
func |
networkx.generators.trees.random_labeled_rooted_tree |
3 | 0 | 0 |
func |
networkx.generators.trees.random_unlabeled_rooted_forest |
5 | 1 | 0 |
func |
networkx.generators.trees.random_labeled_rooted_forest |
3 | 0 | 0 |
func |
networkx.generators.trees.prefix_tree_recursive |
2 | 1 | 0 |
func |
networkx.generators.trees.random_unlabeled_rooted_tree |
4 | 1 | 0 |
func |
networkx.generators.trees.random_unlabeled_tree |
4 | 1 | 0 |
func |
networkx.generators.trees.random_labeled_tree |
3 | 0 | 0 |
networkx.generators.triads (1 missing, 0 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
func |
networkx.generators.triads.triad_graph |
2 | 1 | 0 |
networkx.lazy_imports (5 missing, 0 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
func |
networkx.lazy_imports.attach |
4 | 0 | 0 |
func |
networkx.lazy_imports._lazy_import |
2 | 1 | 0 |
networkx.readwrite.adjlist (11 missing, 0 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
func |
networkx.readwrite.adjlist.read_adjlist |
7 | 2 | 0 |
func |
networkx.readwrite.adjlist.write_adjlist |
6 | 5 | 0 |
func |
networkx.readwrite.adjlist.parse_adjlist |
6 | 1 | 0 |
networkx.readwrite.edgelist (18 missing, 0 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
func |
networkx.readwrite.edgelist.read_edgelist |
9 | 3 | 0 |
func |
networkx.readwrite.edgelist.write_weighted_edgelist |
6 | 5 | 0 |
func |
networkx.readwrite.edgelist.read_weighted_edgelist |
7 | 2 | 0 |
func |
networkx.readwrite.edgelist.parse_edgelist |
7 | 2 | 0 |
func |
networkx.readwrite.edgelist.write_edgelist |
7 | 6 | 0 |
networkx.readwrite.gexf (5 missing, 0 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
func |
networkx.readwrite.gexf.read_gexf |
5 | 2 | 0 |
func |
networkx.readwrite.gexf.relabel_gexf_graph |
2 | 1 | 0 |
func |
networkx.readwrite.gexf.write_gexf |
6 | 5 | 0 |
networkx.readwrite.gml (9 missing, 0 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
func |
networkx.readwrite.gml.write_gml |
4 | 2 | 0 |
func |
networkx.readwrite.gml.generate_gml |
3 | 2 | 0 |
func |
networkx.readwrite.gml.parse_gml |
4 | 1 | 0 |
func |
networkx.readwrite.gml.read_gml |
4 | 1 | 0 |
networkx.readwrite.graph6 (8 missing, 0 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
func |
networkx.readwrite.graph6.read_graph6 |
2 | 0 | 0 |
func |
networkx.readwrite.graph6.to_graph6_bytes |
4 | 2 | 0 |
func |
networkx.readwrite.graph6.from_graph6_bytes |
2 | 1 | 0 |
func |
networkx.readwrite.graph6.write_graph6 |
5 | 2 | 0 |
networkx.readwrite.graphml (58 missing, 15 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
func |
networkx.readwrite.graphml.write_graphml_lxml |
8 | 5 | 0 |
func |
networkx.readwrite.graphml.write_graphml_xml |
8 | 6 | 0 |
func |
networkx.readwrite.graphml.parse_graphml |
5 | 1 | 0 |
meth |
GraphMLReader.init |
4 | 2 | 0 |
meth |
GraphMLReader.call |
3 | 1 | 0 |
meth |
GraphMLReader.make_graph |
5 | 0 | 0 |
meth |
GraphMLReader.add_node |
5 | 2 | 0 |
meth |
GraphMLReader.add_edge |
4 | 2 | 0 |
meth |
GraphMLReader.decode_data_elements |
3 | 0 | 0 |
meth |
GraphMLReader.find_graphml_keys |
2 | 0 | 0 |
attr |
GraphMLReader.node_type |
1 | 1 | 1 |
attr |
GraphMLReader.edge_key_type |
1 | 1 | 1 |
attr |
GraphMLReader.multigraph |
1 | 1 | 1 |
attr |
GraphMLReader.edge_ids |
1 | 1 | 1 |
attr |
GraphMLReader.xml |
1 | 1 | 1 |
func |
networkx.readwrite.graphml.generate_graphml |
6 | 5 | 0 |
meth |
GraphMLWriter.init |
7 | 5 | 0 |
meth |
GraphMLWriter.attr_type |
4 | 0 | 0 |
meth |
GraphMLWriter.get_key |
5 | 0 | 0 |
meth |
GraphMLWriter.add_data |
6 | 1 | 0 |
meth |
GraphMLWriter.add_attributes |
5 | 1 | 0 |
meth |
GraphMLWriter.add_nodes |
3 | 2 | 0 |
meth |
GraphMLWriter.add_edges |
3 | 2 | 0 |
meth |
GraphMLWriter.add_graphs |
2 | 1 | 0 |
meth |
GraphMLWriter.dump |
2 | 1 | 0 |
meth |
GraphMLWriter.indent |
3 | 2 | 0 |
attr |
GraphMLWriter.myElement |
1 | 1 | 1 |
attr |
GraphMLWriter.infer_numeric_types |
1 | 1 | 1 |
attr |
GraphMLWriter.prettyprint |
1 | 1 | 1 |
attr |
GraphMLWriter.named_key_ids |
1 | 1 | 1 |
attr |
GraphMLWriter.edge_id_from_attribute |
1 | 1 | 1 |
attr |
GraphMLWriter.encoding |
1 | 1 | 1 |
attr |
GraphMLWriter.xml |
1 | 1 | 1 |
attr |
GraphMLWriter.keys |
1 | 1 | 1 |
attr |
GraphMLWriter.attributes |
1 | 1 | 1 |
attr |
GraphMLWriter.attribute_types |
1 | 1 | 1 |
func |
networkx.readwrite.graphml.read_graphml |
5 | 1 | 0 |
networkx.readwrite.json_graph.adjacency (4 missing, 0 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
func |
networkx.readwrite.json_graph.adjacency.adjacency_graph |
5 | 2 | 0 |
func |
networkx.readwrite.json_graph.adjacency.adjacency_data |
3 | 2 | 0 |
networkx.readwrite.json_graph.cytoscape (2 missing, 0 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
func |
networkx.readwrite.json_graph.cytoscape.cytoscape_graph |
4 | 2 | 0 |
networkx.readwrite.json_graph.node_link (4 missing, 0 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
func |
networkx.readwrite.json_graph.node_link.node_link_graph |
11 | 8 | 0 |
func |
networkx.readwrite.json_graph.node_link.node_link_data |
8 | 7 | 0 |
networkx.readwrite.json_graph.tree (4 missing, 0 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
func |
networkx.readwrite.json_graph.tree.tree_graph |
4 | 2 | 0 |
func |
networkx.readwrite.json_graph.tree.tree_data |
5 | 3 | 0 |
networkx.readwrite.leda (4 missing, 0 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
func |
networkx.readwrite.leda.parse_leda |
2 | 0 | 0 |
func |
networkx.readwrite.leda.read_leda |
3 | 1 | 0 |
networkx.readwrite.multiline_adjlist (16 missing, 0 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
func |
networkx.readwrite.multiline_adjlist.parse_multiline_adjlist |
7 | 1 | 0 |
func |
networkx.readwrite.multiline_adjlist.read_multiline_adjlist |
8 | 2 | 0 |
func |
networkx.readwrite.multiline_adjlist.write_multiline_adjlist |
6 | 2 | 0 |
networkx.readwrite.p2g (3 missing, 0 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
func |
networkx.readwrite.p2g.read_p2g |
3 | 2 | 0 |
func |
networkx.readwrite.p2g.write_p2g |
4 | 3 | 0 |
func |
networkx.readwrite.p2g.parse_p2g |
2 | 1 | 0 |
networkx.readwrite.pajek (5 missing, 0 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
func |
networkx.readwrite.pajek.write_pajek |
4 | 3 | 0 |
func |
networkx.readwrite.pajek.parse_pajek |
2 | 0 | 0 |
func |
networkx.readwrite.pajek.read_pajek |
3 | 1 | 0 |
networkx.readwrite.sparse6 (7 missing, 0 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
func |
networkx.readwrite.sparse6.to_sparse6_bytes |
4 | 2 | 0 |
func |
networkx.readwrite.sparse6.write_sparse6 |
5 | 3 | 0 |
func |
networkx.readwrite.sparse6.from_sparse6_bytes |
2 | 1 | 0 |
func |
networkx.readwrite.sparse6.read_sparse6 |
2 | 0 | 0 |
networkx.readwrite.text (8 missing, 0 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
func |
networkx.readwrite.text.generate_network_text |
7 | 4 | 0 |
func |
networkx.readwrite.text.write_network_text |
9 | 4 | 0 |
networkx.relabel (1 missing, 0 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
func |
networkx.relabel.convert_node_labels_to_integers |
5 | 4 | 0 |
networkx.utils.backends (4 missing, 7 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
meth |
_dispatchable.reduce |
1 | 0 | 0 |
prop |
_dispatchable.doc |
2 | 0 | 0 |
prop |
_dispatchable.signature |
1 | 0 | 0 |
attr |
_dispatchable.defaults |
1 | 1 | 1 |
attr |
_dispatchable.kwdefaults |
1 | 1 | 1 |
attr |
_dispatchable.module |
1 | 1 | 1 |
attr |
_dispatchable.qualname |
1 | 1 | 1 |
attr |
_dispatchable.wrapped |
1 | 1 | 1 |
attr |
_dispatchable.optional_graphs |
1 | 1 | 1 |
attr |
_dispatchable.list_graphs |
1 | 1 | 1 |
networkx.utils.configs (7 missing, 0 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
meth |
Config.new |
2 | 1 | 0 |
meth |
Config.setattr |
3 | 2 | 0 |
meth |
Config.getitem |
2 | 1 | 0 |
meth |
Config.setitem |
3 | 2 | 0 |
meth |
Config.get |
3 | 1 | 0 |
meth |
Config.call |
2 | 1 | 0 |
networkx.utils.decorators (18 missing, 0 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
meth |
argmap.init |
4 | 2 | 0 |
meth |
argmap.call |
2 | 1 | 0 |
meth |
argmap.compile |
2 | 1 | 0 |
meth |
argmap.assemble |
2 | 0 | 0 |
meth |
argmap.signature |
2 | 0 | 0 |
func |
networkx.utils.decorators.py_random_state |
2 | 0 | 0 |
func |
networkx.utils.decorators.nodes_or_number |
2 | 0 | 0 |
func |
networkx.utils.decorators.np_random_state |
2 | 0 | 0 |
func |
networkx.utils.decorators.not_implemented_for |
2 | 0 | 0 |
func |
networkx.utils.decorators.open_file |
3 | 1 | 0 |
networkx.utils.heaps (17 missing, 0 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
meth |
BinaryHeap.get |
3 | 0 | 0 |
meth |
BinaryHeap.insert |
4 | 2 | 0 |
meth |
PairingHeap.get |
3 | 0 | 0 |
meth |
PairingHeap.insert |
4 | 2 | 0 |
meth |
MinHeap.get |
3 | 0 | 0 |
meth |
MinHeap.insert |
4 | 2 | 0 |
meth |
MinHeap.nonzero |
1 | 0 | 0 |
meth |
MinHeap.contains |
2 | 1 | 0 |
networkx.utils.mapped_queue (9 missing, 2 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
meth |
MappedQueue.init |
2 | 1 | 0 |
meth |
MappedQueue.push |
3 | 0 | 0 |
meth |
MappedQueue.pop |
1 | 0 | 0 |
meth |
MappedQueue.update |
4 | 1 | 0 |
meth |
MappedQueue.remove |
2 | 1 | 0 |
attr |
MappedQueue.heap |
1 | 1 | 1 |
attr |
MappedQueue.position |
1 | 1 | 1 |
networkx.utils.misc (48 missing, 0 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
func |
networkx.utils.misc.edges_equal |
4 | 2 | 0 |
func |
networkx.utils.misc.groups |
2 | 0 | 0 |
func |
networkx.utils.misc.create_random_state |
2 | 0 | 0 |
func |
networkx.utils.misc.create_py_random_state |
2 | 1 | 0 |
func |
networkx.utils.misc.arbitrary_element |
2 | 0 | 0 |
func |
networkx.utils.misc.make_list_of_ints |
2 | 0 | 0 |
func |
networkx.utils.misc.graphs_equal |
3 | 1 | 0 |
func |
networkx.utils.misc.dict_to_numpy_array |
3 | 0 | 0 |
func |
networkx.utils.misc.flatten |
3 | 0 | 0 |
func |
networkx.utils.misc.pairwise |
3 | 1 | 0 |
meth |
PythonRandomInterface.init |
2 | 1 | 0 |
meth |
PythonRandomInterface.random |
1 | 0 | 0 |
meth |
PythonRandomInterface.uniform |
3 | 0 | 0 |
meth |
PythonRandomInterface.randrange |
3 | 0 | 0 |
meth |
PythonRandomInterface.choice |
2 | 0 | 0 |
meth |
PythonRandomInterface.gauss |
3 | 0 | 0 |
meth |
PythonRandomInterface.shuffle |
2 | 0 | 0 |
meth |
PythonRandomInterface.sample |
3 | 0 | 0 |
meth |
PythonRandomInterface.randint |
3 | 0 | 0 |
meth |
PythonRandomInterface.expovariate |
2 | 0 | 0 |
meth |
PythonRandomInterface.paretovariate |
2 | 0 | 0 |
func |
networkx.utils.misc.nodes_equal |
3 | 1 | 0 |
networkx.utils.random_sequence (19 missing, 0 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
func |
networkx.utils.random_sequence.discrete_sequence |
5 | 0 | 0 |
func |
networkx.utils.random_sequence.zipf_rv |
4 | 2 | 0 |
func |
networkx.utils.random_sequence.cumulative_distribution |
2 | 0 | 0 |
func |
networkx.utils.random_sequence.weighted_choice |
3 | 0 | 0 |
func |
networkx.utils.random_sequence.powerlaw_sequence |
4 | 1 | 0 |
func |
networkx.utils.random_sequence.random_weighted_sample |
4 | 0 | 0 |
networkx.utils.rcm (3 missing, 0 any)
| Symbol | Typable | Typed | Any | |
|---|---|---|---|---|
func |
networkx.utils.rcm.cuthill_mckee_ordering |
3 | 2 | 0 |
func |
networkx.utils.rcm.reverse_cuthill_mckee_ordering |
3 | 1 | 0 |
Type-Ignore Comments
| Flavor | Count |
|---|---|
type: ignore[override] |
14 |
type: ignore[import-not-found] |
8 |
pyright: ignore[reportMissingImports] |
6 |
type: ignore[import-untyped] |
4 |
type: ignore[overload-overlap] |
4 |
type: ignore[assignment] |
2 |
type: ignore[misc] |
2 |