Upgrading networkx 0.99 to 1
Unknown0.99 → 1.11
UnknownUpgrade verdict
24 of 27 releases publish no notes, so breaking changes can't be ruled out.
In plain terms
- Some releases in this range publish no notes, so DepDelta can't rule out breaking changes.
- Their commits are listed with this comparison.
Must act Unknown for releases without notes
Releases without notes may still need changes. Check their commits before upgrading.
Adds decorator >=3.4.0.
Installs 1 package in all (was 0).
API changes
Generated by DepDelta from published Python source. Not mixed with prose notes.
- added:
export networkx - added:
export release - added:
export test - added:
variable m
- added:
export all_node_cuts - added:
export all_pairs_node_connectivity - added:
export average_node_connectivity - added:
export capacity_scaling - added:
export complete_bipartite_graph - added:
export cost_of_flow - added:
export could_be_isomorphic - added:
export edge_connectivity - added:
export fast_could_be_isomorphic - added:
export faster_could_be_isomorphic - added:
export is_bipartite - added:
export is_isomorphic - added:
export k_components - added:
export max_flow_min_cost - added:
export maximum_branching - added:
export maximum_flow - added:
export maximum_flow_value - added:
export maximum_spanning_arborescence - added:
export min_cost_flow - added:
export min_cost_flow_cost - added:
export minimum_branching - added:
export minimum_cut - added:
export minimum_cut_value - added:
export minimum_edge_cut - added:
export minimum_node_cut - added:
export minimum_spanning_arborescence - added:
export network_simplex - added:
export networkx - added:
export node_connectivity - added:
export project - added:
export projected_graph - added:
export stoer_wagner
- added:
function clique_removal(G) - added:
function max_clique(G)
- added:
function average_clustering(G, trials=…)
- added:
function all_pairs_node_connectivity(G, nbunch=…, cutoff=…) - added:
function local_node_connectivity(G, source, target, cutoff=…) - added:
function node_connectivity(G, s=…, t=…)
- added:
function min_edge_dominating_set(G) - added:
function min_weighted_dominating_set(G, weight=…)
- added:
function maximum_independent_set(G)
- added:
function k_components(G, min_density=…)
- added:
function min_maximal_matching(G)
- added:
function ramsey_R2(G)
- added:
function min_weighted_vertex_cover(G, weight=…)
- added:
function average_degree_connectivity(G, source=…, target=…, nodes=…, weight=…) - added:
variable k_nearest_neighbors
- added:
function attribute_assortativity_coefficient(G, attribute, nodes=…) - added:
function degree_assortativity_coefficient(G, x=…, y=…, weight=…, nodes=…) - added:
function degree_pearson_correlation_coefficient(G, x=…, y=…, weight=…, nodes=…) - added:
function numeric_assortativity_coefficient(G, attribute, nodes=…)
- added:
function attribute_mixing_dict(G, attribute, nodes=…, normalized=…) - added:
function attribute_mixing_matrix(G, attribute, nodes=…, mapping=…, normalized=…) - added:
function degree_mixing_dict(G, x=…, y=…, weight=…, nodes=…, normalized=…) - added:
function degree_mixing_matrix(G, x=…, y=…, weight=…, nodes=…, normalized=…) - added:
function mixing_dict(xy, normalized=…) - added:
function numeric_mixing_matrix(G, attribute, nodes=…, normalized=…)
- added:
function average_neighbor_degree(G, source=…, target=…, nodes=…, weight=…)
- added:
function node_attribute_xy(G, attribute, nodes=…) - added:
function node_degree_xy(G, x=…, y=…, weight=…, nodes=…)
- added:
function color(G) - added:
function degrees(B, nodes, weight=…) - added:
function density(B, nodes) - added:
function is_bipartite(G) - added:
function is_bipartite_node_set(G, nodes) - added:
function sets(G)
- added:
function betweenness_centrality(G, nodes) - added:
function closeness_centrality(G, nodes, normalized=…) - added:
function degree_centrality(G, nodes)
- added:
function average_clustering(G, nodes=…, mode=…) - added:
function latapy_clustering(G, nodes=…, mode=…) - added:
function robins_alexander_clustering(G) - added:
variable clustering
- added:
function generate_edgelist(G, delimiter=…, data=…) - added:
function parse_edgelist(lines, comments=…, delimiter=…, create_using=…, nodetype=…, data=…) - added:
function read_edgelist(path, comments=…, delimiter=…, create_using=…, nodetype=…, data=…, edgetype=…, encoding=…) - added:
function write_edgelist(G, path, comments=…, delimiter=…, data=…, encoding=…)
- added:
function alternating_havel_hakimi_graph(aseq, bseq, create_using=…) - added:
function complete_bipartite_graph(n1, n2, create_using=…) - added:
function configuration_model(aseq, bseq, create_using=…, seed=…) - added:
function gnmk_random_graph(n, m, k, seed=…, directed=…) - added:
function havel_hakimi_graph(aseq, bseq, create_using=…) - added:
function preferential_attachment_graph(aseq, p, create_using=…, seed=…) - added:
function random_graph(n, m, p, seed=…, directed=…) - added:
function reverse_havel_hakimi_graph(aseq, bseq, create_using=…)
- added:
function eppstein_matching(G) - added:
function hopcroft_karp_matching(G) - added:
function to_vertex_cover(G, matching) - added:
variable maximum_matching
- added:
function biadjacency_matrix(G, row_order, column_order=…, dtype=…, weight=…, format=…) - added:
function from_biadjacency_matrix(A, create_using=…, edge_attribute=…)
- added:
function collaboration_weighted_projected_graph(B, nodes) - added:
function generic_weighted_projected_graph(B, nodes, weight_function=…) - added:
function overlap_weighted_projected_graph(B, nodes, jaccard=…) - added:
function project(B, nodes, create_using=…) - added:
function projected_graph(B, nodes, multigraph=…) - added:
function weighted_projected_graph(B, nodes, ratio=…)
- added:
function node_redundancy(G, nodes=…)
- added:
function spectral_bipartivity(G, nodes=…, weight=…)
- added:
function blockmodel(G, partitions, multigraph=…)
- removed:
function betweenness_centrality_source(G, normalized=…, weighted_edges=…, sources=…) - removed:
function brandes_betweenness_centrality(G, normalized=…, weighted_edges=…) - removed:
function closeness_centrality(G, v=…, weighted_edges=…) - removed:
function degree_centrality(G, v=…) - removed:
function edge_betweenness(G, normalized=…, weighted_edges=…, sources=…) - removed:
function edge_load(G, nodes=…, cutoff=…) - removed:
function newman_betweenness_centrality(G, v=…, cutoff=…, normalized=…, weighted_edges=…) - removed:
variable betweenness_centrality - removed:
variable load_centrality
- added:
function betweenness_centrality(G, k=…, normalized=…, weight=…, endpoints=…, seed=…) - added:
function edge_betweenness(G, k=…, normalized=…, weight=…, seed=…) - added:
function edge_betweenness_centrality(G, k=…, normalized=…, weight=…, seed=…)
- added:
function betweenness_centrality_source(G, normalized=…, weight=…, sources=…) - added:
function betweenness_centrality_subset(G, sources, targets, normalized=…, weight=…) - added:
function edge_betweenness_centrality_subset(G, sources, targets, normalized=…, weight=…)
- added:
function closeness_centrality(G, u=…, distance=…, normalized=…)
- added:
function communicability(G) - added:
function communicability_betweenness_centrality(G, normalized=…) - added:
function communicability_centrality(G) - added:
function communicability_centrality_exp(G) - added:
function communicability_exp(G) - added:
function estrada_index(G)
- added:
function approximate_current_flow_betweenness_centrality(G, normalized=…, weight=…, dtype=…, solver=…, epsilon=…, kmax=…) - added:
function current_flow_betweenness_centrality(G, normalized=…, weight=…, dtype=…, solver=…) - added:
function edge_current_flow_betweenness_centrality(G, normalized=…, weight=…, dtype=…, solver=…)
- added:
function current_flow_betweenness_centrality_subset(G, sources, targets, normalized=…, weight=…, dtype=…, solver=…) - added:
function edge_current_flow_betweenness_centrality_subset(G, sources, targets, normalized=…, weight=…, dtype=…, solver=…)
- added:
function current_flow_closeness_centrality(G, weight=…, dtype=…, solver=…) - added:
variable information_centrality
- added:
function degree_centrality(G) - added:
function in_degree_centrality(G) - added:
function out_degree_centrality(G)
- added:
function dispersion(G, u=…, v=…, normalized=…, alpha=…, b=…, c=…)
- added:
function eigenvector_centrality(G, max_iter=…, tol=…, nstart=…, weight=…) - added:
function eigenvector_centrality_numpy(G, weight=…)
- added:
class CGInverseLaplacian(InverseLaplacian) - added:
class FullInverseLaplacian(InverseLaplacian) - added:
class InverseLaplacian(object) - added:
class SuperLUInverseLaplacian(InverseLaplacian) - added:
constructor InverseLaplacian(L, width=…, dtype=…) - added:
function flow_matrix_row(G, weight=…, dtype=…, solver=…) - added:
function laplacian_sparse_matrix(G, nodelist=…, weight=…, dtype=…, format=…) - added:
method CGInverseLaplacian.init_solver(L) - added:
method CGInverseLaplacian.solve(rhs) - added:
method CGInverseLaplacian.solve_inverse(r) - added:
method FullInverseLaplacian.init_solver(L) - added:
method FullInverseLaplacian.solve(rhs) - added:
method FullInverseLaplacian.solve_inverse(r) - added:
method InverseLaplacian.get_row(r) - added:
method InverseLaplacian.get_rows(r1, r2) - added:
method InverseLaplacian.init_solver(L) - added:
method InverseLaplacian.solve(r) - added:
method InverseLaplacian.solve_inverse(r) - added:
method InverseLaplacian.width(L) - added:
method SuperLUInverseLaplacian.init_solver(L) - added:
method SuperLUInverseLaplacian.solve(rhs) - added:
method SuperLUInverseLaplacian.solve_inverse(r)
- added:
function harmonic_centrality(G, distance=…)
- added:
function katz_centrality(G, alpha=…, beta=…, max_iter=…, tol=…, nstart=…, normalized=…, weight=…) - added:
function katz_centrality_numpy(G, alpha=…, beta=…, normalized=…, weight=…)
- added:
function edge_load(G, nodes=…, cutoff=…) - added:
variable load_centrality
- added:
class NetworkXTreewidthBoundExceeded(nx.NetworkXException) - added:
function chordal_graph_cliques(G) - added:
function chordal_graph_treewidth(G) - added:
function find_induced_nodes(G, s, t, treewidth_bound=…) - added:
function is_chordal(G)
- changed:
function cliques_containing_node(G, nodes=…, cliques=…, with_labels=…) → function cliques_containing_node(G, nodes=…, cliques=…) - changed:
function node_clique_number(G, nodes=…, with_labels=…, cliques=…) → function node_clique_number(G, nodes=…, cliques=…) - changed:
function number_of_cliques(G, nodes=…, cliques=…, with_labels=…) → function number_of_cliques(G, nodes=…, cliques=…) - added:
function enumerate_all_cliques(G) - added:
function find_cliques_recursive(G)
- changed:
function average_clustering(G) → function average_clustering(G, nodes=…, weight=…, count_zeros=…) - changed:
function clustering(G, nbunch=…, with_labels=…, weights=…) → function clustering(G, nodes=…, weight=…) - changed:
function triangles(G, nbunch=…, with_labels=…) → function triangles(G, nodes=…) - added:
function square_clustering(G, nodes=…)
- added:
function greedy_color(G, strategy=…, interchange=…) - added:
function strategy_connected_sequential(G, colors, traversal=…) - added:
function strategy_connected_sequential_bfs(G, colors) - added:
function strategy_connected_sequential_dfs(G, colors) - added:
function strategy_independent_set(G, colors) - added:
function strategy_largest_first(G, colors) - added:
function strategy_random_sequential(G, colors) - added:
function strategy_saturation_largest_first(G, colors) - added:
function strategy_smallest_last(G, colors)
- added:
function greedy_coloring_with_interchange(original_graph, nodes)
- added:
function k_clique_communities(G, k, cliques=…)
- added:
function attracting_component_subgraphs(G, copy=…) - added:
function attracting_components(G) - added:
function is_attracting_component(G) - added:
function number_attracting_components(G)
- added:
function articulation_points(G) - added:
function biconnected_component_edges(G) - added:
function biconnected_component_subgraphs(G, copy=…) - added:
function biconnected_components(G) - added:
function is_biconnected(G)
- added:
function connected_component_subgraphs(G, copy=…) - added:
function connected_components(G) - added:
function is_connected(G) - added:
function node_connected_component(G, n) - added:
function number_connected_components(G)
- added:
function is_semiconnected(G)
- added:
function condensation(G, scc=…) - added:
function is_strongly_connected(G) - added:
function kosaraju_strongly_connected_components(G, source=…) - added:
function number_strongly_connected_components(G) - added:
function strongly_connected_component_subgraphs(G, copy=…) - added:
function strongly_connected_components(G) - added:
function strongly_connected_components_recursive(G)
- added:
function is_weakly_connected(G) - added:
function number_weakly_connected_components(G) - added:
function weakly_connected_component_subgraphs(G, copy=…) - added:
function weakly_connected_components(G)
- added:
function all_pairs_node_connectivity(G, nbunch=…, flow_func=…) - added:
function average_node_connectivity(G, flow_func=…) - added:
function edge_connectivity(G, s=…, t=…, flow_func=…) - added:
function local_edge_connectivity(G, u, v, flow_func=…, auxiliary=…, residual=…, cutoff=…) - added:
function local_node_connectivity(G, s, t, flow_func=…, auxiliary=…, residual=…, cutoff=…) - added:
function node_connectivity(G, s=…, t=…, flow_func=…)
- added:
function minimum_edge_cut(G, s=…, t=…, flow_func=…) - added:
function minimum_node_cut(G, s=…, t=…, flow_func=…) - added:
function minimum_st_edge_cut(G, s, t, flow_func=…, auxiliary=…, residual=…) - added:
function minimum_st_node_cut(G, s, t, flow_func=…, auxiliary=…, residual=…)
- added:
function k_components(G, flow_func=…)
- added:
function all_node_cuts(G, k=…, flow_func=…)
- added:
function stoer_wagner(G, weight=…, heap=…)
- added:
function build_auxiliary_edge_connectivity(G) - added:
function build_auxiliary_node_connectivity(G)
- removed:
function find_cores(G, with_labels=…) - added:
function core_number(G) - added:
function k_core(G, k=…, core_number=…) - added:
function k_corona(G, k, core_number=…) - added:
function k_crust(G, k=…, core_number=…) - added:
function k_shell(G, k=…, core_number=…) - added:
variable find_cores
- added:
function cycle_basis(G, root=…) - added:
function find_cycle(G, source=…, orientation=…) - added:
function recursive_simple_cycles(G) - added:
function simple_cycles(G)
- added:
function ancestors(G, source) - added:
function antichains(G) - added:
function dag_longest_path(G) - added:
function dag_longest_path_length(G) - added:
function descendants(G, source) - added:
function is_aperiodic(G) - added:
function is_directed_acyclic_graph(G) - added:
function topological_sort(G, nbunch=…, reverse=…) - added:
function topological_sort_recursive(G, nbunch=…, reverse=…) - added:
function transitive_closure(G)
- added:
function center(G, e=…) - added:
function diameter(G, e=…) - added:
function eccentricity(G, v=…, sp=…) - added:
function periphery(G, e=…) - added:
function radius(G, e=…)
- added:
function global_parameters(b, c) - added:
function intersection_array(G) - added:
function is_distance_regular(G)
- added:
function dominance_frontiers(G, start) - added:
function immediate_dominators(G, start)
- added:
function dominating_set(G, start_with=…) - added:
function is_dominating_set(G, nbunch)
- added:
function eulerian_circuit(G, source=…) - added:
function is_eulerian(G)
- added:
export build_flow_dict - added:
export build_residual_network
- added:
function capacity_scaling(G, demand=…, capacity=…, weight=…, heap=…)
- added:
function edmonds_karp(G, s, t, capacity=…, residual=…, value_only=…, cutoff=…)
- added:
function maximum_flow(G, s, t, capacity=…, flow_func=…, **kwargs) - added:
function maximum_flow_value(G, s, t, capacity=…, flow_func=…, **kwargs) - added:
function minimum_cut(G, s, t, capacity=…, flow_func=…, **kwargs) - added:
function minimum_cut_value(G, s, t, capacity=…, flow_func=…, **kwargs)
- added:
function cost_of_flow(G, flowDict, weight=…) - added:
function max_flow_min_cost(G, s, t, capacity=…, weight=…) - added:
function min_cost_flow(G, demand=…, capacity=…, weight=…) - added:
function min_cost_flow_cost(G, demand=…, capacity=…, weight=…)
- added:
function network_simplex(G, demand=…, capacity=…, weight=…)
- added:
function preflow_push(G, s, t, capacity=…, residual=…, global_relabel_freq=…, value_only=…)
- added:
function shortest_augmenting_path(G, s, t, capacity=…, residual=…, value_only=…, two_phase=…, cutoff=…)
- added:
class CurrentEdge(object) - added:
class GlobalRelabelThreshold(object) - added:
class Level(object) - added:
constructor CurrentEdge(edges) - added:
constructor GlobalRelabelThreshold(n, m, freq) - added:
constructor Level() - added:
function build_flow_dict(G, R) - added:
function build_residual_network(G, capacity) - added:
function detect_unboundedness(R, s, t) - added:
method CurrentEdge.get() - added:
method CurrentEdge.move_to_next() - added:
method GlobalRelabelThreshold.add_work(work) - added:
method GlobalRelabelThreshold.clear_work() - added:
method GlobalRelabelThreshold.is_reached()
- added:
function is_digraphical(in_sequence, out_sequence) - added:
function is_graphical(sequence, method=…) - added:
function is_multigraphical(sequence) - added:
function is_pseudographical(sequence) - added:
function is_valid_degree_sequence_erdos_gallai(deg_sequence) - added:
function is_valid_degree_sequence_havel_hakimi(deg_sequence) - added:
variable is_valid_degree_sequence
- added:
function flow_hierarchy(G, weight=…)
- added:
function is_kl_connected(G, k, l, low_memory=…) - added:
function kl_connected_subgraph(G, k, l, low_memory=…, same_as_graph=…)
- added:
function is_isolate(G, n) - added:
function isolates(G)
- added:
function could_be_isomorphic(G1, G2) - added:
function fast_could_be_isomorphic(G1, G2) - added:
function faster_could_be_isomorphic(G1, G2) - added:
function is_isomorphic(G1, G2, node_match=…, edge_match=…)
- removed:
method DiGraphMatcher.is_isomorphic() - removed:
method DiGraphMatcher.match(state) - removed:
method DiGraphMatcher.semantic_feasibility(G1_node, G2_node) - removed:
method DiGraphMatcher.subgraph_is_isomorphic() - changed:
class DiGraphMatcher(object) → class DiGraphMatcher(GraphMatcher) - changed:
method GraphMatcher.match(state) → method GraphMatcher.match() - added:
method DiGraphMatcher.initialize() - added:
method GraphMatcher.initialize() - added:
method GraphMatcher.isomorphisms_iter() - added:
method GraphMatcher.reset_recursion_limit() - added:
method GraphMatcher.subgraph_isomorphisms_iter()
- added:
function categorical_edge_match(*args, **kwargs) - added:
function categorical_multiedge_match(attr, default) - added:
function categorical_node_match(attr, default) - added:
function generic_edge_match(*args, **kwargs) - added:
function generic_multiedge_match(attr, default, op) - added:
function generic_node_match(attr, default, op) - added:
function numerical_edge_match(*args, **kwargs) - added:
function numerical_multiedge_match(attr, default, rtol=…, atol=…) - added:
function numerical_node_match(attr, default, rtol=…, atol=…) - added:
variable categorical_edge_match - added:
variable generic_edge_match - added:
variable numerical_edge_match
- added:
class DiGraphMatcher(vf2.DiGraphMatcher) - added:
class GraphMatcher(vf2.GraphMatcher) - added:
class MultiDiGraphMatcher(DiGraphMatcher) - added:
class MultiGraphMatcher(GraphMatcher) - added:
constructor DiGraphMatcher(G1, G2, node_match=…, edge_match=…) - added:
constructor GraphMatcher(G1, G2, node_match=…, edge_match=…) - added:
field GraphMatcher.semantic_feasibility - added:
method DiGraphMatcher.semantic_feasibility(G1_node, G2_node)
- added:
function authority_matrix(G, nodelist=…) - added:
function hits(G, max_iter=…, tol=…, nstart=…, normalized=…) - added:
function hits_numpy(G, normalized=…) - added:
function hits_scipy(G, max_iter=…, tol=…, normalized=…) - added:
function hub_matrix(G, nodelist=…)
- added:
function google_matrix(G, alpha=…, personalization=…, nodelist=…, weight=…, dangling=…) - added:
function pagerank(G, alpha=…, personalization=…, max_iter=…, tol=…, nstart=…, weight=…, dangling=…) - added:
function pagerank_numpy(G, alpha=…, personalization=…, weight=…, dangling=…) - added:
function pagerank_scipy(G, alpha=…, personalization=…, max_iter=…, tol=…, weight=…, dangling=…)
- added:
function adamic_adar_index(G, ebunch=…) - added:
function cn_soundarajan_hopcroft(G, ebunch=…, community=…) - added:
function jaccard_coefficient(G, ebunch=…) - added:
function preferential_attachment(G, ebunch=…) - added:
function ra_index_soundarajan_hopcroft(G, ebunch=…, community=…) - added:
function resource_allocation_index(G, ebunch=…) - added:
function within_inter_cluster(G, ebunch=…, delta=…, community=…)
- added:
function max_weight_matching(G, maxcardinality=…) - added:
function maximal_matching(G)
- added:
function contracted_edge(G, edge, self_loops=…) - added:
function contracted_nodes(G, u, v, self_loops=…) - added:
function quotient_graph(G, node_relation, edge_relation=…, create_using=…) - added:
variable identified_nodes
- added:
function maximal_independent_set(G, nodes=…)
- added:
function minimum_spanning_edges(G, weight=…, data=…) - added:
function minimum_spanning_tree(G, weight=…) - added:
function prim_mst(G, weight=…) - added:
function prim_mst_edges(G, weight=…, data=…) - added:
variable kruskal_mst
- added:
function compose_all(graphs, name=…) - added:
function disjoint_union_all(graphs) - added:
function intersection_all(graphs) - added:
function union_all(graphs, rename=…, name=…)
- added:
function compose(G, H, name=…) - added:
function difference(G, H) - added:
function disjoint_union(G, H) - added:
function intersection(G, H) - added:
function symmetric_difference(G, H) - added:
function union(G, H, rename=…, name=…)
- added:
function cartesian_product(G, H) - added:
function lexicographic_product(G, H) - added:
function power(G, k) - added:
function strong_product(G, H) - added:
function tensor_product(G, H)
- added:
function complement(G, name=…) - added:
function reverse(G, copy=…)
- added:
function rich_club_coefficient(G, normalized=…, Q=…)
- added:
function astar_path(G, source, target, heuristic=…, weight=…) - added:
function astar_path_length(G, source, target, heuristic=…, weight=…)
- added:
function floyd_warshall(G, weight=…) - added:
function floyd_warshall_numpy(G, nodelist=…, weight=…) - added:
function floyd_warshall_predecessor_and_distance(G, weight=…)
- added:
function all_shortest_paths(G, source, target, weight=…) - added:
function average_shortest_path_length(G, weight=…) - added:
function has_path(G, source, target) - added:
function shortest_path(G, source=…, target=…, weight=…) - added:
function shortest_path_length(G, source=…, target=…, weight=…)
- added:
function all_pairs_shortest_path(G, cutoff=…) - added:
function all_pairs_shortest_path_length(G, cutoff=…) - added:
function bidirectional_shortest_path(G, source, target) - added:
function predecessor(G, source, target=…, cutoff=…, return_seen=…) - added:
function single_source_shortest_path(G, source, cutoff=…) - added:
function single_source_shortest_path_length(G, source, cutoff=…)
- added:
function all_pairs_dijkstra_path(G, cutoff=…, weight=…) - added:
function all_pairs_dijkstra_path_length(G, cutoff=…, weight=…) - added:
function bellman_ford(G, source, weight=…) - added:
function bidirectional_dijkstra(G, source, target, weight=…) - added:
function dijkstra_path(G, source, target, weight=…) - added:
function dijkstra_path_length(G, source, target, weight=…) - added:
function dijkstra_predecessor_and_distance(G, source, cutoff=…, weight=…) - added:
function goldberg_radzik(G, source, weight=…) - added:
function johnson(G, weight=…) - added:
function negative_edge_cycle(G, weight=…) - added:
function single_source_dijkstra(G, source, target=…, cutoff=…, weight=…) - added:
function single_source_dijkstra_path(G, source, cutoff=…, weight=…) - added:
function single_source_dijkstra_path_length(G, source, cutoff=…, weight=…)
- added:
function all_simple_paths(G, source, target, cutoff=…) - added:
function shortest_simple_paths(G, source, target, weight=…)
- added:
function s_metric(G, normalized=…)
- added:
function connected_double_edge_swap(G, nswap=…, _window_threshold=…) - added:
function double_edge_swap(G, nswap=…, max_tries=…)
- added:
function bfs_edges(G, source, reverse=…) - added:
function bfs_predecessors(G, source) - added:
function bfs_successors(G, source) - added:
function bfs_tree(G, source, reverse=…)
- removed:
function is_directed_acyclic_graph(G) - removed:
function topological_sort(G) - removed:
function topological_sort_recursive(G)
- added:
function dfs_edges(G, source=…) - added:
function dfs_labeled_edges(G, source=…) - added:
function dfs_postorder_nodes(G, source=…) - added:
function dfs_predecessors(G, source=…) - added:
function dfs_preorder_nodes(G, source=…) - added:
function dfs_successors(G, source=…) - added:
function dfs_tree(G, source)
- added:
function edge_dfs(G, source=…, orientation=…)
- removed:
function dfs_postorder(G, source=…, reverse_graph=…) - removed:
function dfs_predecessor(G, source=…, reverse_graph=…) - removed:
function dfs_preorder(G, source=…, reverse_graph=…) - removed:
function dfs_successor(G, source=…, reverse_graph=…) - removed:
function dfs_tree(G, source=…, reverse_graph=…)
- added:
class Edmonds(object) - added:
constructor Edmonds(G, seed=…) - added:
function branching_weight(G, attr=…, default=…) - added:
function greedy_branching(G, attr=…, default=…, kind=…) - added:
function maximum_branching(G, attr=…, default=…) - added:
function maximum_spanning_arborescence(G, attr=…, default=…) - added:
function minimum_branching(G, attr=…, default=…) - added:
function minimum_spanning_arborescence(G, attr=…, default=…) - added:
method Edmonds.find_optimum(attr=…, default=…, kind=…, style=…)
- added:
function is_arborescence(G) - added:
function is_branching(G) - added:
function is_forest(G) - added:
function is_tree(G)
- added:
function triadic_census(G)
- added:
function closeness_vitality(G, weight=…)
- added:
export DiGraph - added:
export Graph - added:
export MultiDiGraph - added:
export MultiGraph
- added:
class DiGraph(Graph) - added:
constructor DiGraph(data=…, **attr) - added:
field DiGraph.neighbors - added:
field DiGraph.neighbors_iter - added:
field DiGraph.out_edges - added:
field DiGraph.out_edges_iter - added:
method DiGraph.add_edge(u, v, attr_dict=…, **attr) - added:
method DiGraph.add_edges_from(ebunch, attr_dict=…, **attr) - added:
method DiGraph.add_node(n, attr_dict=…, **attr) - added:
method DiGraph.add_nodes_from(nodes, **attr) - added:
method DiGraph.clear() - added:
method DiGraph.degree_iter(nbunch=…, weight=…) - added:
method DiGraph.edges_iter(nbunch=…, data=…, default=…) - added:
method DiGraph.has_predecessor(u, v) - added:
method DiGraph.has_successor(u, v) - added:
method DiGraph.in_degree(nbunch=…, weight=…) - added:
method DiGraph.in_degree_iter(nbunch=…, weight=…) - added:
method DiGraph.in_edges(nbunch=…, data=…) - added:
method DiGraph.in_edges_iter(nbunch=…, data=…) - added:
method DiGraph.is_directed() - added:
method DiGraph.is_multigraph() - added:
method DiGraph.out_degree(nbunch=…, weight=…) - added:
method DiGraph.out_degree_iter(nbunch=…, weight=…) - added:
method DiGraph.predecessors(n) - added:
method DiGraph.predecessors_iter(n) - added:
method DiGraph.remove_edge(u, v) - added:
method DiGraph.remove_edges_from(ebunch) - added:
method DiGraph.remove_node(n) - added:
method DiGraph.remove_nodes_from(nbunch) - added:
method DiGraph.reverse(copy=…) - added:
method DiGraph.subgraph(nbunch) - added:
method DiGraph.successors(n) - added:
method DiGraph.successors_iter(n) - added:
method DiGraph.to_directed() - added:
method DiGraph.to_undirected(reciprocal=…)
- added:
function all_neighbors(graph, node) - added:
function common_neighbors(G, u, v) - added:
function create_empty_copy(G, with_nodes=…) - added:
function degree(G, nbunch=…, weight=…) - added:
function degree_histogram(G) - added:
function density(G) - added:
function edges(G, nbunch=…) - added:
function edges_iter(G, nbunch=…) - added:
function freeze(G) - added:
function get_edge_attributes(G, name) - added:
function get_node_attributes(G, name) - added:
function info(G, n=…) - added:
function is_directed(G) - added:
function is_empty(G) - added:
function is_frozen(G) - added:
function is_negatively_weighted(G, edge=…, weight=…) - added:
function is_weighted(G, edge=…, weight=…) - added:
function neighbors(G, n) - added:
function nodes(G) - added:
function nodes_iter(G) - added:
function non_edges(graph) - added:
function non_neighbors(graph, node) - added:
function number_of_edges(G) - added:
function number_of_nodes(G) - added:
function set_edge_attributes(G, name, values) - added:
function set_node_attributes(G, name, values) - added:
function subgraph(G, nbunch)
- added:
class Graph(object) - added:
constructor Graph(data=…, **attr) - added:
field Graph.adjlist_dict_factory - added:
field Graph.edge_attr_dict_factory - added:
field Graph.node_dict_factory - added:
method Graph.add_cycle(nodes, **attr) - added:
method Graph.add_edge(u, v, attr_dict=…, **attr) - added:
method Graph.add_edges_from(ebunch, attr_dict=…, **attr) - added:
method Graph.add_node(n, attr_dict=…, **attr) - added:
method Graph.add_nodes_from(nodes, **attr) - added:
method Graph.add_path(nodes, **attr) - added:
method Graph.add_star(nodes, **attr) - added:
method Graph.add_weighted_edges_from(ebunch, weight=…, **attr) - added:
method Graph.adjacency_iter() - added:
method Graph.adjacency_list() - added:
method Graph.clear() - added:
method Graph.copy() - added:
method Graph.degree(nbunch=…, weight=…) - added:
method Graph.degree_iter(nbunch=…, weight=…) - added:
method Graph.edges(nbunch=…, data=…, default=…) - added:
method Graph.edges_iter(nbunch=…, data=…, default=…) - added:
method Graph.get_edge_data(u, v, default=…) - added:
method Graph.has_edge(u, v) - added:
method Graph.has_node(n) - added:
method Graph.is_directed() - added:
method Graph.is_multigraph() - added:
method Graph.nbunch_iter(nbunch=…) - added:
method Graph.neighbors(n) - added:
method Graph.neighbors_iter(n) - added:
method Graph.nodes(data=…) - added:
method Graph.nodes_iter(data=…) - added:
method Graph.nodes_with_selfloops() - added:
method Graph.number_of_edges(u=…, v=…) - added:
method Graph.number_of_nodes() - added:
method Graph.number_of_selfloops() - added:
method Graph.order() - added:
method Graph.remove_edge(u, v) - added:
method Graph.remove_edges_from(ebunch) - added:
method Graph.remove_node(n) - added:
method Graph.remove_nodes_from(nodes) - added:
method Graph.selfloop_edges(data=…, default=…) - added:
method Graph.size(weight=…) - added:
method Graph.subgraph(nbunch) - added:
method Graph.to_directed() - added:
method Graph.to_undirected() - added:
property Graph.name
- removed:
class LabeledDiGraph(LabeledGraph, DiGraph)
- removed:
class LabeledDiGraph(LabeledGraph, DiGraph) - removed:
class LabeledGraph(Graph) - removed:
constructor LabeledGraph(data=…, name=…, weighted=…) - removed:
method LabeledGraph.add_node(n, data=…) - removed:
method LabeledGraph.add_nodes_from(nbunch, data=…) - removed:
method LabeledGraph.clear() - removed:
method LabeledGraph.get_node(n) - removed:
method LabeledGraph.nodes(nbunch=…, data=…) - removed:
method LabeledGraph.nodes_iter(nbunch=…, data=…) - removed:
method LabeledGraph.remove_node(n) - removed:
method LabeledGraph.remove_nodes_from(nbunch) - removed:
method LabeledGraph.subgraph(nbunch, copy=…) - removed:
method LabeledGraph.to_directed()
- added:
class MultiDiGraph(MultiGraph, DiGraph) - added:
constructor MultiDiGraph(data=…, **attr) - added:
field MultiDiGraph.edge_key_dict_factory - added:
field MultiDiGraph.out_edges_iter - added:
method MultiDiGraph.add_edge(u, v, key=…, attr_dict=…, **attr) - added:
method MultiDiGraph.degree_iter(nbunch=…, weight=…) - added:
method MultiDiGraph.edges_iter(nbunch=…, data=…, keys=…, default=…) - added:
method MultiDiGraph.in_degree_iter(nbunch=…, weight=…) - added:
method MultiDiGraph.in_edges(nbunch=…, keys=…, data=…) - added:
method MultiDiGraph.in_edges_iter(nbunch=…, data=…, keys=…) - added:
method MultiDiGraph.is_directed() - added:
method MultiDiGraph.is_multigraph() - added:
method MultiDiGraph.out_degree_iter(nbunch=…, weight=…) - added:
method MultiDiGraph.out_edges(nbunch=…, keys=…, data=…) - added:
method MultiDiGraph.remove_edge(u, v, key=…) - added:
method MultiDiGraph.reverse(copy=…) - added:
method MultiDiGraph.subgraph(nbunch) - added:
method MultiDiGraph.to_directed() - added:
method MultiDiGraph.to_undirected(reciprocal=…)
- added:
class MultiGraph(Graph) - added:
constructor MultiGraph(data=…, **attr) - added:
field MultiGraph.edge_key_dict_factory - added:
method MultiGraph.add_edge(u, v, key=…, attr_dict=…, **attr) - added:
method MultiGraph.add_edges_from(ebunch, attr_dict=…, **attr) - added:
method MultiGraph.degree_iter(nbunch=…, weight=…) - added:
method MultiGraph.edges(nbunch=…, data=…, keys=…, default=…) - added:
method MultiGraph.edges_iter(nbunch=…, data=…, keys=…, default=…) - added:
method MultiGraph.get_edge_data(u, v, key=…, default=…) - added:
method MultiGraph.has_edge(u, v, key=…) - added:
method MultiGraph.is_directed() - added:
method MultiGraph.is_multigraph() - added:
method MultiGraph.number_of_edges(u=…, v=…) - added:
method MultiGraph.remove_edge(u, v, key=…) - added:
method MultiGraph.remove_edges_from(ebunch) - added:
method MultiGraph.selfloop_edges(data=…, keys=…, default=…) - added:
method MultiGraph.subgraph(nbunch) - added:
method MultiGraph.to_directed()
- added:
class OrderedDiGraph(DiGraph) - added:
class OrderedGraph(Graph) - added:
class OrderedMultiDiGraph(MultiDiGraph) - added:
class OrderedMultiGraph(MultiGraph) - added:
field OrderedDiGraph.adjlist_dict_factory - added:
field OrderedDiGraph.edge_attr_dict_factory - added:
field OrderedDiGraph.node_dict_factory - added:
field OrderedGraph.adjlist_dict_factory - added:
field OrderedGraph.edge_attr_dict_factory - added:
field OrderedGraph.node_dict_factory - added:
field OrderedMultiDiGraph.adjlist_dict_factory - added:
field OrderedMultiDiGraph.edge_attr_dict_factory - added:
field OrderedMultiDiGraph.edge_key_dict_factory - added:
field OrderedMultiDiGraph.node_dict_factory - added:
field OrderedMultiGraph.adjlist_dict_factory - added:
field OrderedMultiGraph.edge_attr_dict_factory - added:
field OrderedMultiGraph.edge_key_dict_factory - added:
field OrderedMultiGraph.node_dict_factory
- added:
function from_dict_of_dicts(d, create_using=…, multigraph_input=…) - added:
function from_dict_of_lists(d, create_using=…) - added:
function from_edgelist(edgelist, create_using=…) - added:
function to_dict_of_dicts(G, nodelist=…, edge_data=…) - added:
function to_dict_of_lists(G, nodelist=…) - added:
function to_edgelist(G, nodelist=…) - added:
function to_networkx_graph(data, create_using=…, multigraph_input=…)
- added:
function from_numpy_matrix(A, parallel_edges=…, create_using=…) - added:
function from_pandas_dataframe(df, source, target, edge_attr=…, create_using=…) - added:
function from_scipy_sparse_matrix(A, parallel_edges=…, create_using=…, edge_attribute=…) - added:
function to_numpy_matrix(G, nodelist=…, dtype=…, order=…, multigraph_weight=…, weight=…, nonedge=…) - added:
function to_numpy_recarray(G, nodelist=…, dtype=…, order=…) - added:
function to_pandas_dataframe(G, nodelist=…, multigraph_weight=…, weight=…, nonedge=…) - added:
function to_scipy_sparse_matrix(G, nodelist=…, dtype=…, weight=…, format=…)
- added:
export nx_agraph - added:
export nx_pydot
- added:
function circular_layout(G, dim=…, scale=…, center=…) - added:
function fruchterman_reingold_layout(G, dim=…, k=…, pos=…, fixed=…, iterations=…, weight=…, scale=…, center=…) - added:
function random_layout(G, dim=…, scale=…, center=…) - added:
function shell_layout(G, nlist=…, dim=…, scale=…, center=…) - added:
function spectral_layout(G, dim=…, weight=…, scale=…, center=…) - added:
variable spring_layout
- added:
function from_agraph(A, create_using=…) - added:
function graphviz_layout(G, prog=…, root=…, args=…) - added:
function pygraphviz_layout(G, prog=…, root=…, args=…) - added:
function read_dot(path) - added:
function to_agraph(N) - added:
function view_pygraphviz(G, edgelabel=…, prog=…, args=…, suffix=…, path=…) - added:
function write_dot(G, path)
- added:
function from_pydot(P) - added:
function graphviz_layout(G, prog=…, root=…, **kwds) - added:
function pydot_layout(G, prog=…, root=…, **kwds) - added:
function read_dot(path) - added:
function to_pydot(N, strict=…) - added:
function write_dot(G, path)
- added:
function draw(G, pos=…, ax=…, hold=…, **kwds) - added:
function draw_circular(G, **kwargs) - added:
function draw_graphviz(G, prog=…, **kwargs) - added:
function draw_networkx(G, pos=…, arrows=…, with_labels=…, **kwds) - added:
function draw_networkx_edge_labels(G, pos, edge_labels=…, label_pos=…, font_size=…, font_color=…, font_family=…, font_weight=…, alpha=…, bbox=…, ax=…, rotate=…, **kwds) - added:
function draw_networkx_edges(G, pos, edgelist=…, width=…, edge_color=…, style=…, alpha=…, edge_cmap=…, edge_vmin=…, edge_vmax=…, ax=…, arrows=…, label=…, **kwds) - added:
function draw_networkx_labels(G, pos, labels=…, font_size=…, font_color=…, font_family=…, font_weight=…, alpha=…, bbox=…, ax=…, **kwds) - added:
function draw_networkx_nodes(G, pos, nodelist=…, node_size=…, node_color=…, node_shape=…, alpha=…, cmap=…, vmin=…, vmax=…, ax=…, linewidths=…, label=…, **kwds) - added:
function draw_random(G, **kwargs) - added:
function draw_shell(G, **kwargs) - added:
function draw_spectral(G, **kwargs) - added:
function draw_spring(G, **kwargs)
- added:
class NetworkXAlgorithmError(NetworkXException) - added:
class NetworkXError(NetworkXException) - added:
class NetworkXException(Exception) - added:
class NetworkXNoCycle(NetworkXUnfeasible) - added:
class NetworkXNoPath(NetworkXUnfeasible) - added:
class NetworkXNotImplemented(NetworkXException) - added:
class NetworkXPointlessConcept(NetworkXException) - added:
class NetworkXUnbounded(NetworkXAlgorithmError) - added:
class NetworkXUnfeasible(NetworkXAlgorithmError)
- added:
function balanced_tree(r, h, create_using=…) - added:
function barbell_graph(m1, m2, create_using=…) - added:
function circulant_graph(n, offsets, create_using=…) - added:
function circular_ladder_graph(n, create_using=…) - added:
function complete_graph(n, create_using=…) - added:
function complete_multipartite_graph(*block_sizes) - added:
function cycle_graph(n, create_using=…) - added:
function dorogovtsev_goltsev_mendes_graph(n, create_using=…) - added:
function empty_graph(n=…, create_using=…) - added:
function full_rary_tree(r, n, create_using=…) - added:
function grid_2d_graph(m, n, periodic=…, create_using=…) - added:
function grid_graph(dim, periodic=…) - added:
function hypercube_graph(n) - added:
function ladder_graph(n, create_using=…) - added:
function lollipop_graph(m, n, create_using=…) - added:
function null_graph(create_using=…) - added:
function path_graph(n, create_using=…) - added:
function star_graph(n, create_using=…) - added:
function trivial_graph(create_using=…) - added:
function wheel_graph(n, create_using=…)
- added:
function caveman_graph(l, k) - added:
function connected_caveman_graph(l, k) - added:
function gaussian_random_partition_graph(n, s, v, p_in, p_out, directed=…, seed=…) - added:
function planted_partition_graph(l, k, p_in, p_out, seed=…, directed=…) - added:
function random_partition_graph(sizes, p_in, p_out, seed=…, directed=…) - added:
function relaxed_caveman_graph(l, k, p, seed=…)
- added:
function configuration_model(deg_sequence, create_using=…, seed=…) - added:
function degree_sequence_tree(deg_sequence, create_using=…) - added:
function directed_configuration_model(in_degree_sequence, out_degree_sequence, create_using=…, seed=…) - added:
function directed_havel_hakimi_graph(in_deg_sequence, out_deg_sequence, create_using=…) - added:
function expected_degree_graph(w, seed=…, selfloops=…) - added:
function havel_hakimi_graph(deg_sequence, create_using=…) - added:
function random_degree_sequence_graph(sequence, seed=…, tries=…)
- changed:
function gn_graph(n, kernel=…, seed=…) → function gn_graph(n, kernel=…, create_using=…, seed=…) - changed:
function gnc_graph(n, seed=…) → function gnc_graph(n, create_using=…, seed=…) - changed:
function gnr_graph(n, p, seed=…) → function gnr_graph(n, p, create_using=…, seed=…) - added:
function scale_free_graph(n, alpha=…, beta=…, gamma=…, delta_in=…, delta_out=…, create_using=…, seed=…)
- added:
function ego_graph(G, n, radius=…, center=…, undirected=…, distance=…)
- added:
function chordal_cycle_graph(p, create_using=…) - added:
function margulis_gabber_galil_graph(n, create_using=…)
- changed:
function random_geometric_graph(n, radius, create_using=…, repel=…, verbose=…, dim=…) → function random_geometric_graph(n, radius, dim=…, pos=…) - added:
function geographical_threshold_graph(n, theta, alpha=…, dim=…, pos=…, weight=…) - added:
function navigable_small_world_graph(n, p=…, q=…, r=…, dim=…, seed=…) - added:
function waxman_graph(n, alpha=…, beta=…, L=…, domain=…)
- removed:
function is_kl_connected(G, k, l, low_memory=…) - removed:
function kl_connected_subgraph(G, k, l, low_memory=…, same_as_graph=…)
- added:
function general_random_intersection_graph(n, m, p) - added:
function k_random_intersection_graph(n, m, k) - added:
function uniform_random_intersection_graph(n, m, p, seed=…)
- added:
function line_graph(G, create_using=…)
- added:
function nonisomorphic_trees(order, create=…) - added:
function number_of_nonisomorphic_trees(order)
- added:
function random_clustered_graph(joint_degree_sequence, create_using=…, seed=…)
- added:
function barabasi_albert_graph(n, m, seed=…) - added:
function connected_watts_strogatz_graph(n, k, p, tries=…, seed=…) - added:
function dense_gnm_random_graph(n, m, seed=…) - added:
function duplication_divergence_graph(n, p, seed=…) - added:
function fast_gnp_random_graph(n, p, seed=…, directed=…) - added:
function gnm_random_graph(n, m, seed=…, directed=…) - added:
function gnp_random_graph(n, p, seed=…, directed=…) - added:
function newman_watts_strogatz_graph(n, k, p, seed=…) - added:
function powerlaw_cluster_graph(n, m, p, seed=…) - added:
function random_lobster(n, p1, p2, seed=…) - added:
function random_powerlaw_tree(n, gamma=…, seed=…, tries=…) - added:
function random_powerlaw_tree_sequence(n, gamma=…, seed=…, tries=…) - added:
function random_regular_graph(d, n, seed=…) - added:
function random_shell_graph(constructor, seed=…) - added:
function watts_strogatz_graph(n, k, p, seed=…) - added:
variable binomial_graph - added:
variable erdos_renyi_graph
- added:
function LCF_graph(n, shift_list, repeats, create_using=…) - added:
function bull_graph(create_using=…) - added:
function chvatal_graph(create_using=…) - added:
function cubical_graph(create_using=…) - added:
function desargues_graph(create_using=…) - added:
function diamond_graph(create_using=…) - added:
function dodecahedral_graph(create_using=…) - added:
function frucht_graph(create_using=…) - added:
function heawood_graph(create_using=…) - added:
function house_graph(create_using=…) - added:
function house_x_graph(create_using=…) - added:
function icosahedral_graph(create_using=…) - added:
function krackhardt_kite_graph(create_using=…) - added:
function make_small_graph(graph_description, create_using=…) - added:
function moebius_kantor_graph(create_using=…) - added:
function octahedral_graph(create_using=…) - added:
function pappus_graph() - added:
function petersen_graph(create_using=…) - added:
function sedgewick_maze_graph(create_using=…) - added:
function tetrahedral_graph(create_using=…) - added:
function truncated_cube_graph(create_using=…) - added:
function truncated_tetrahedron_graph(create_using=…) - added:
function tutte_graph(create_using=…)
- added:
function davis_southern_women_graph() - added:
function florentine_families_graph() - added:
function karate_club_graph()
- added:
function stochastic_graph(G, copy=…, weight=…)
- added:
export networkx
- added:
function attr_matrix(G, edge_attr=…, node_attr=…, normalized=…, rc_order=…, dtype=…, order=…) - added:
function attr_sparse_matrix(G, edge_attr=…, node_attr=…, normalized=…, rc_order=…, dtype=…)
- added:
function adjacency_matrix(G, nodelist=…, weight=…) - added:
function incidence_matrix(G, nodelist=…, edgelist=…, oriented=…, weight=…) - added:
variable adj_matrix
- added:
function directed_laplacian_matrix(G, nodelist=…, weight=…, walk_type=…, alpha=…) - added:
function laplacian_matrix(G, nodelist=…, weight=…) - added:
function normalized_laplacian_matrix(G, nodelist=…, weight=…)
- added:
function directed_modularity_matrix(G, nodelist=…) - added:
function modularity_matrix(G, nodelist=…)
- added:
function adjacency_spectrum(G, weight=…) - added:
function laplacian_spectrum(G, weight=…) - added:
function modularity_spectrum(G)
- removed:
function read_multiline_adjlist(path, comments=…, delimiter=…, create_using=…, nodetype=…, edgetype=…) - removed:
function write_multiline_adjlist(G, path, delimiter=…, comments=…) - changed:
function read_adjlist(path, comments=…, delimiter=…, create_using=…, nodetype=…) → function read_adjlist(path, comments=…, delimiter=…, create_using=…, nodetype=…, encoding=…) - changed:
function write_adjlist(G, path, comments=…, delimiter=…) → function write_adjlist(G, path, comments=…, delimiter=…, encoding=…) - added:
function generate_adjlist(G, delimiter=…) - added:
function parse_adjlist(lines, comments=…, delimiter=…, create_using=…, nodetype=…)
- changed:
function read_edgelist(path, comments=…, delimiter=…, create_using=…, nodetype=…, edgetype=…) → function read_edgelist(path, comments=…, delimiter=…, create_using=…, nodetype=…, data=…, edgetype=…, encoding=…) - changed:
function write_edgelist(G, path, comments=…, delimiter=…) → function write_edgelist(G, path, comments=…, delimiter=…, data=…, encoding=…) - added:
function generate_edgelist(G, delimiter=…, data=…) - added:
function parse_edgelist(lines, comments=…, delimiter=…, create_using=…, nodetype=…, data=…) - added:
function read_weighted_edgelist(path, comments=…, delimiter=…, create_using=…, nodetype=…, encoding=…) - added:
function write_weighted_edgelist(G, path, comments=…, delimiter=…, encoding=…)
- added:
function generate_gexf(G, encoding=…, prettyprint=…, version=…) - added:
function read_gexf(path, node_type=…, relabel=…, version=…) - added:
function relabel_gexf_graph(G) - added:
function write_gexf(G, path, encoding=…, prettyprint=…, version=…)
- added:
function generate_gml(G, stringizer=…) - added:
function parse_gml(lines, label=…, destringizer=…) - added:
function read_gml(path, label=…, destringizer=…) - added:
function write_gml(G, path, stringizer=…)
- changed:
function write_gpickle(G, path) → function write_gpickle(G, path, protocol=…)
- added:
function generate_graph6(G, nodes=…, header=…) - added:
function parse_graph6(string) - added:
function read_graph6(path) - added:
function write_graph6(G, path, nodes=…, header=…)
- added:
class GraphMLReader(GraphML) - added:
class GraphMLWriter(GraphML) - added:
constructor GraphMLReader(node_type=…) - added:
constructor GraphMLWriter(graph=…, encoding=…, prettyprint=…) - added:
function generate_graphml(G, encoding=…, prettyprint=…) - added:
function parse_graphml(graphml_string, node_type=…) - added:
function read_graphml(path, node_type=…) - added:
function write_graphml(G, path, encoding=…, prettyprint=…) - added:
method GraphMLReader.add_edge(G, edge_element, graphml_keys) - added:
method GraphMLReader.add_node(G, node_xml, graphml_keys) - added:
method GraphMLReader.decode_data_elements(graphml_keys, obj_xml) - added:
method GraphMLReader.find_graphml_keys(graph_element) - added:
method GraphMLReader.make_graph(graph_xml, graphml_keys, defaults) - added:
method GraphMLWriter.add_attributes(scope, xml_obj, data, default) - added:
method GraphMLWriter.add_data(name, element_type, value, scope=…, default=…) - added:
method GraphMLWriter.add_edges(G, graph_element) - added:
method GraphMLWriter.add_graph_element(G) - added:
method GraphMLWriter.add_graphs(graph_list) - added:
method GraphMLWriter.add_nodes(G, graph_element) - added:
method GraphMLWriter.dump(stream) - added:
method GraphMLWriter.get_key(name, attr_type, scope, default) - added:
method GraphMLWriter.indent(elem, level=…)
- added:
function adjacency_data(G, attrs=…) - added:
function adjacency_graph(data, directed=…, multigraph=…, attrs=…)
- added:
function node_link_data(G, attrs=…) - added:
function node_link_graph(data, directed=…, multigraph=…, attrs=…)
- added:
function tree_data(G, root, attrs=…) - added:
function tree_graph(data, attrs=…)
- added:
function parse_leda(lines) - added:
function read_leda(path, encoding=…)
- added:
function generate_multiline_adjlist(G, delimiter=…) - added:
function parse_multiline_adjlist(lines, comments=…, delimiter=…, create_using=…, nodetype=…, edgetype=…) - added:
function read_multiline_adjlist(path, comments=…, delimiter=…, create_using=…, nodetype=…, edgetype=…, encoding=…) - added:
function write_multiline_adjlist(G, path, delimiter=…, comments=…, encoding=…)
- added:
function read_shp(path, simplify=…) - added:
function write_shp(G, outdir)
- added:
function read_yaml(path) - added:
function write_yaml(G, path, encoding=…, **kwds)
- added:
function parse_p2g(lines) - added:
function read_p2g(path, encoding=…) - added:
function write_p2g(G, path, encoding=…)
- added:
function generate_pajek(G) - added:
function parse_pajek(lines) - added:
function read_pajek(path, encoding=…) - added:
function write_pajek(G, path, encoding=…)
- added:
function generate_sparse6(G, nodes=…, header=…) - added:
function parse_sparse6(string) - added:
function read_sparse6(path) - added:
function write_sparse6(G, path, nodes=…, header=…)
- added:
function convert_node_labels_to_integers(G, first_label=…, ordering=…, label_attribute=…) - added:
function relabel_nodes(G, mapping, copy=…)
- removed:
function get_svn_revision() - removed:
variable revision - added:
function get_info(dynamic=…) - added:
function get_revision() - added:
function write_versionfile() - added:
variable basedir - added:
variable date_info - added:
variable dev - added:
variable maintainer - added:
variable maintainer_email - added:
variable major - added:
variable minor - added:
variable vcs_info - added:
variable version_info
- removed:
class UbiDiGraph(UbiGraph, MultiDiGraph) - removed:
class UbiGraph(MultiGraph) - removed:
constructor UbiDiGraph(data=…, name=…, selfloops=…, multiedges=…, ubigraph_server=…, clear=…) - removed:
constructor UbiGraph(data=…, name=…, selfloops=…, multiedges=…, ubigraph_server=…, clear=…, nextid=…) - removed:
method UbiDiGraph.add_edge(u, v=…, x=…, **kwds) - removed:
method UbiDiGraph.add_node(n, **kwds) - removed:
method UbiDiGraph.clear() - removed:
method UbiDiGraph.delete_edge(u, v=…, x=…) - removed:
method UbiDiGraph.delete_node(n) - removed:
method UbiGraph.add_edge(u, v=…, x=…, **kwds) - removed:
method UbiGraph.add_edges_from(ebunch, **kwds) - removed:
method UbiGraph.add_node(n, **kwds) - removed:
method UbiGraph.add_nodes_from(nlist, **kwds) - removed:
method UbiGraph.clear() - removed:
method UbiGraph.delete_edge(u, v=…, x=…) - removed:
method UbiGraph.delete_edges_from(ebunch) - removed:
method UbiGraph.delete_node(n) - removed:
method UbiGraph.delete_nodes_from(nlist) - removed:
method UbiGraph.edge_labels(ebunch=…, labels=…) - removed:
method UbiGraph.new_edge_style(style=…, **kwds) - removed:
method UbiGraph.new_node_style(style=…, **kwds) - removed:
method UbiGraph.node_labels(nbunch=…, labels=…) - removed:
method UbiGraph.set_edge_attr(ebunch=…, style=…, **kwds) - removed:
method UbiGraph.set_node_attr(nbunch=…, style=…, **kwds) - removed:
method UbiGraph.splines()
- added:
function reversed(G)
- added:
function not_implemented_for(*graph_types) - added:
function open_file(path_arg, mode=…)
- added:
class BinaryHeap(MinHeap) - added:
class MinHeap(object) - added:
class PairingHeap(MinHeap) - added:
constructor BinaryHeap() - added:
constructor MinHeap() - added:
constructor PairingHeap() - added:
method BinaryHeap.get(key, default=…) - added:
method BinaryHeap.insert(key, value, allow_increase=…) - added:
method BinaryHeap.min() - added:
method BinaryHeap.pop() - added:
method MinHeap.get(key, default=…) - added:
method MinHeap.insert(key, value, allow_increase=…) - added:
method MinHeap.min() - added:
method MinHeap.pop() - added:
method PairingHeap.get(key, default=…) - added:
method PairingHeap.insert(key, value, allow_increase=…) - added:
method PairingHeap.min() - added:
method PairingHeap.pop()
- added:
function accumulate(iterable, func=…) - added:
function default_opener(filename) - added:
function dict_to_numpy_array(d, mapping=…) - added:
function dict_to_numpy_array1(d, mapping=…) - added:
function dict_to_numpy_array2(d, mapping=…) - added:
function flatten(obj, result=…) - added:
function generate_unique_node() - added:
function is_list_of_ints(intlist) - added:
function is_string_like(obj) - added:
function iterable(obj) - added:
function make_str(x) - added:
variable PY2
- added:
function create_degree_sequence(n, sfunction=…, max_tries=…, **kwds) - added:
function cumulative_distribution(distribution) - added:
function discrete_sequence(n, distribution=…, cdistribution=…) - added:
function pareto_sequence(n, exponent=…) - added:
function powerlaw_sequence(n, exponent=…) - added:
function random_weighted_sample(mapping, k) - added:
function uniform_sequence(n) - added:
function weighted_choice(mapping) - added:
function zipf_rv(alpha, xmin=…, seed=…) - added:
function zipf_sequence(n, alpha=…, xmin=…)
- added:
function cuthill_mckee_ordering(G, heuristic=…) - added:
function reverse_cuthill_mckee_ordering(G, heuristic=…)
- added:
class UnionFind - added:
constructor UnionFind() - added:
method UnionFind.union(*objects)
- added:
variable date - added:
variable date_info - added:
variable dev - added:
variable vcs_info - added:
variable version - added:
variable version_info
- removed:
class autosummary_toc(nodes.comment) - removed:
function autolink_role(typ, rawtext, etext, lineno, inliner, options=…, content=…) - removed:
function autosummary_directive(dirname, arguments, options, content, lineno, content_offset, block_text, state, state_machine) - removed:
function autosummary_toc_depart_noop(self, node) - removed:
function autosummary_toc_visit_html(self, node) - removed:
function autosummary_toc_visit_latex(self, node) - removed:
function get_autosummary(names, state, no_signatures=…) - removed:
function import_by_name(name, prefixes=…) - removed:
function process_autosummary_toc(app, doctree) - removed:
function setup(app)
- removed:
class Comment(object) - removed:
class CommentBlocker(object) - removed:
class NonComment(object) - removed:
constructor Comment(start_lineno, end_lineno, text) - removed:
constructor CommentBlocker() - removed:
constructor NonComment(start_lineno, end_lineno) - removed:
field Comment.is_comment - removed:
field NonComment.is_comment - removed:
function get_class_traits(klass) - removed:
function strip_comment_marker(text) - removed:
method Comment.add(string, start, end, line) - removed:
method CommentBlocker.make_index() - removed:
method CommentBlocker.new_comment(string, start, end, line) - removed:
method CommentBlocker.new_noncomment(start_lineno, end_lineno) - removed:
method CommentBlocker.process_file(file) - removed:
method CommentBlocker.process_token(kind, string, start, end, line) - removed:
method CommentBlocker.search_for_comment(lineno, default=…) - removed:
method NonComment.add(string, start, end, line)
- removed:
class UnparseCompilerAst - removed:
constructor UnparseCompilerAst(tree, file=…, single_line_functions=…) - removed:
function unparse(ast, single_line_functions=…) - removed:
variable op_precedence
- removed:
class SphinxClassDoc(SphinxDocString, ClassDoc) - removed:
class SphinxDocString(NumpyDocString) - removed:
class SphinxFunctionDoc(SphinxDocString, FunctionDoc) - removed:
function get_doc_object(obj, what=…)
- removed:
class SphinxTraitsDoc(SphinxClassDoc) - removed:
constructor SphinxTraitsDoc(cls, modulename=…, func_doc=…) - removed:
function get_doc_object(obj, what=…) - removed:
function looks_like_issubclass(obj, classname) - removed:
function setup(app)