diff options
| author | Jarrod Millman <jarrod.millman@gmail.com> | 2019-11-08 23:58:15 -0800 |
|---|---|---|
| committer | Jarrod Millman <jarrod.millman@gmail.com> | 2019-11-11 13:39:06 -0800 |
| commit | cd2bde7856dc8057c8269696110ffb75795edf13 (patch) | |
| tree | 5f2e4cfd57a70126115065c911cbe3ed2d995212 | |
| parent | 89daa927a0135a79cc69a75a3c89202158fa2ca7 (diff) | |
| download | networkx-cd2bde7856dc8057c8269696110ffb75795edf13.tar.gz | |
Remove superfluous encoding information
144 files changed, 0 insertions, 163 deletions
diff --git a/doc/bibliography.rst b/doc/bibliography.rst index 95908dfd..16dc95b0 100644 --- a/doc/bibliography.rst +++ b/doc/bibliography.rst @@ -1,5 +1,3 @@ -.. -*- coding: utf-8 -*- - Bibliography ============ diff --git a/doc/citing.rst b/doc/citing.rst index 2561a2c0..1eebc73c 100644 --- a/doc/citing.rst +++ b/doc/citing.rst @@ -1,5 +1,3 @@ -.. -*- coding: utf-8 -*- - Citing ====== diff --git a/doc/conf.py b/doc/conf.py index 8ea0a240..5509f716 100644 --- a/doc/conf.py +++ b/doc/conf.py @@ -1,24 +1,8 @@ -# -*- coding: utf-8 -*- -# -# Sphinx documentation build configuration file, created by -# sphinx-quickstart.py on Sat Mar 8 21:47:50 2008. -# -# This file is execfile()d with the current directory set to its containing dir. -# -# The contents of this file are pickled, so don't put values in the namespace -# that aren't pickleable (module imports are okay, they're removed automatically). -# -# All configuration values have a default value; values that are commented out -# serve to show the default value. - from datetime import date from sphinx_gallery.sorting import ExplicitOrder import sphinx_rtd_theme -# If your extensions are in another directory, add it here. -# These locations are relative to conf.py - # General configuration # --------------------- diff --git a/doc/index.rst b/doc/index.rst index 0c135405..0a942a0a 100644 --- a/doc/index.rst +++ b/doc/index.rst @@ -1,5 +1,3 @@ -.. -*- coding: utf-8 -*- - .. _contents: Overview of NetworkX_ diff --git a/doc/news.rst b/doc/news.rst index 68f0dcdb..0dde232d 100644 --- a/doc/news.rst +++ b/doc/news.rst @@ -1,4 +1,3 @@ -.. -*- coding: utf-8 -*- .. currentmodule:: networkx Release Log diff --git a/doc/tutorial.rst b/doc/tutorial.rst index fdfc9302..075394ab 100644 --- a/doc/tutorial.rst +++ b/doc/tutorial.rst @@ -1,5 +1,3 @@ -.. -*- coding: utf-8 -*- - Tutorial ======== diff --git a/networkx/algorithms/approximation/clique.py b/networkx/algorithms/approximation/clique.py index fe43ebdd..0d5a8fef 100644 --- a/networkx/algorithms/approximation/clique.py +++ b/networkx/algorithms/approximation/clique.py @@ -1,4 +1,3 @@ -# -*- coding: utf-8 -*- """Functions for computing large cliques.""" import networkx as nx from networkx.utils import not_implemented_for diff --git a/networkx/algorithms/approximation/clustering_coefficient.py b/networkx/algorithms/approximation/clustering_coefficient.py index c64bfde3..0d16be48 100644 --- a/networkx/algorithms/approximation/clustering_coefficient.py +++ b/networkx/algorithms/approximation/clustering_coefficient.py @@ -1,4 +1,3 @@ -# -*- coding: utf-8 -*- from networkx.utils import not_implemented_for from networkx.utils import py_random_state diff --git a/networkx/algorithms/approximation/dominating_set.py b/networkx/algorithms/approximation/dominating_set.py index 806cff13..3ba9dcdd 100644 --- a/networkx/algorithms/approximation/dominating_set.py +++ b/networkx/algorithms/approximation/dominating_set.py @@ -1,4 +1,3 @@ -# -*- coding: utf-8 -*- """Functions for finding node and edge dominating sets. A `dominating set`_ for an undirected graph *G* with vertex set *V* diff --git a/networkx/algorithms/approximation/independent_set.py b/networkx/algorithms/approximation/independent_set.py index d4a54825..4cbc02d5 100644 --- a/networkx/algorithms/approximation/independent_set.py +++ b/networkx/algorithms/approximation/independent_set.py @@ -1,4 +1,3 @@ -# -*- coding: utf-8 -*- r""" Independent Set diff --git a/networkx/algorithms/approximation/matching.py b/networkx/algorithms/approximation/matching.py index 742a01c6..8be396c4 100644 --- a/networkx/algorithms/approximation/matching.py +++ b/networkx/algorithms/approximation/matching.py @@ -1,4 +1,3 @@ -# -*- coding: utf-8 -*- """ ************** Graph Matching diff --git a/networkx/algorithms/approximation/ramsey.py b/networkx/algorithms/approximation/ramsey.py index e5066fc1..971bdb33 100644 --- a/networkx/algorithms/approximation/ramsey.py +++ b/networkx/algorithms/approximation/ramsey.py @@ -1,4 +1,3 @@ -# -*- coding: utf-8 -*- """ Ramsey numbers. """ diff --git a/networkx/algorithms/approximation/tests/test_treewidth.py b/networkx/algorithms/approximation/tests/test_treewidth.py index cccea6c0..fdd11f06 100644 --- a/networkx/algorithms/approximation/tests/test_treewidth.py +++ b/networkx/algorithms/approximation/tests/test_treewidth.py @@ -1,4 +1,3 @@ -# -*- coding: utf-8 -*- import networkx as nx from networkx.algorithms.approximation import treewidth_min_degree from networkx.algorithms.approximation import treewidth_min_fill_in diff --git a/networkx/algorithms/approximation/treewidth.py b/networkx/algorithms/approximation/treewidth.py index 19875c64..843f31e3 100644 --- a/networkx/algorithms/approximation/treewidth.py +++ b/networkx/algorithms/approximation/treewidth.py @@ -1,4 +1,3 @@ -# -*- coding: utf-8 -*- """Functions for computing treewidth decomposition. Treewidth of an undirected graph is a number associated with the graph. diff --git a/networkx/algorithms/approximation/vertex_cover.py b/networkx/algorithms/approximation/vertex_cover.py index 6f1b08b1..943de645 100644 --- a/networkx/algorithms/approximation/vertex_cover.py +++ b/networkx/algorithms/approximation/vertex_cover.py @@ -1,4 +1,3 @@ -# -*- coding: utf-8 -*- """Functions for computing an approximate minimum weight vertex cover. A |vertex cover|_ is a subset of nodes such that each edge in the graph diff --git a/networkx/algorithms/assortativity/connectivity.py b/networkx/algorithms/assortativity/connectivity.py index 53921f33..0450fff8 100644 --- a/networkx/algorithms/assortativity/connectivity.py +++ b/networkx/algorithms/assortativity/connectivity.py @@ -1,4 +1,3 @@ -# -*- coding: utf-8 -*- from collections import defaultdict __all__ = ['average_degree_connectivity', diff --git a/networkx/algorithms/assortativity/correlation.py b/networkx/algorithms/assortativity/correlation.py index 760e9ff6..cf2dbc97 100644 --- a/networkx/algorithms/assortativity/correlation.py +++ b/networkx/algorithms/assortativity/correlation.py @@ -1,4 +1,3 @@ -# -*- coding: utf-8 -*- """Node assortativity coefficients and correlation measures. """ from networkx.algorithms.assortativity.mixing import degree_mixing_matrix, \ diff --git a/networkx/algorithms/assortativity/mixing.py b/networkx/algorithms/assortativity/mixing.py index 8147e447..bf7f9e1d 100644 --- a/networkx/algorithms/assortativity/mixing.py +++ b/networkx/algorithms/assortativity/mixing.py @@ -1,4 +1,3 @@ -# -*- coding: utf-8 -*- """ Mixing matrices for node attributes and degree. """ diff --git a/networkx/algorithms/assortativity/neighbor_degree.py b/networkx/algorithms/assortativity/neighbor_degree.py index 06c6d480..0d821e6e 100644 --- a/networkx/algorithms/assortativity/neighbor_degree.py +++ b/networkx/algorithms/assortativity/neighbor_degree.py @@ -1,4 +1,3 @@ -# -*- coding: utf-8 -*- __all__ = ["average_neighbor_degree"] diff --git a/networkx/algorithms/assortativity/pairs.py b/networkx/algorithms/assortativity/pairs.py index f4e5d8dd..ea4d4d9b 100644 --- a/networkx/algorithms/assortativity/pairs.py +++ b/networkx/algorithms/assortativity/pairs.py @@ -1,4 +1,3 @@ -# -*- coding: utf-8 -*- """Generators of x-y pairs of node data.""" __all__ = ['node_attribute_xy', 'node_degree_xy'] diff --git a/networkx/algorithms/asteroidal.py b/networkx/algorithms/asteroidal.py index ddb33ce1..b1626b6b 100644 --- a/networkx/algorithms/asteroidal.py +++ b/networkx/algorithms/asteroidal.py @@ -1,4 +1,3 @@ -# -*- coding: utf-8 -*- """ Algorithms for asteroidal triples and asteroidal numbers in graphs. diff --git a/networkx/algorithms/bipartite/basic.py b/networkx/algorithms/bipartite/basic.py index b4a2c3bd..83d053a4 100644 --- a/networkx/algorithms/bipartite/basic.py +++ b/networkx/algorithms/bipartite/basic.py @@ -1,4 +1,3 @@ -# -*- coding: utf-8 -*- """ ========================== Bipartite Graph Algorithms diff --git a/networkx/algorithms/bipartite/centrality.py b/networkx/algorithms/bipartite/centrality.py index 07f40b53..baa66cef 100644 --- a/networkx/algorithms/bipartite/centrality.py +++ b/networkx/algorithms/bipartite/centrality.py @@ -1,4 +1,3 @@ -# -*- coding: utf-8 -*- import networkx as nx __all__ = ['degree_centrality', diff --git a/networkx/algorithms/bipartite/cluster.py b/networkx/algorithms/bipartite/cluster.py index fef87393..4a178c2d 100644 --- a/networkx/algorithms/bipartite/cluster.py +++ b/networkx/algorithms/bipartite/cluster.py @@ -1,4 +1,3 @@ -# -*- coding: utf-8 -*- """Functions for computing clustering of pairs """ diff --git a/networkx/algorithms/bipartite/generators.py b/networkx/algorithms/bipartite/generators.py index ee6104f4..a83bd114 100644 --- a/networkx/algorithms/bipartite/generators.py +++ b/networkx/algorithms/bipartite/generators.py @@ -1,4 +1,3 @@ -# -*- coding: utf-8 -*- """ Generators and functions for bipartite graphs. """ diff --git a/networkx/algorithms/bipartite/matrix.py b/networkx/algorithms/bipartite/matrix.py index 389dc2af..9573d1ef 100644 --- a/networkx/algorithms/bipartite/matrix.py +++ b/networkx/algorithms/bipartite/matrix.py @@ -1,4 +1,3 @@ -# -*- coding: utf-8 -*- """ ==================== Biadjacency matrices diff --git a/networkx/algorithms/bipartite/projection.py b/networkx/algorithms/bipartite/projection.py index 5b6316e2..1c9752c1 100644 --- a/networkx/algorithms/bipartite/projection.py +++ b/networkx/algorithms/bipartite/projection.py @@ -1,4 +1,3 @@ -# -*- coding: utf-8 -*- """One-mode (unipartite) projections of bipartite graphs.""" import networkx as nx from networkx.utils import not_implemented_for diff --git a/networkx/algorithms/bipartite/redundancy.py b/networkx/algorithms/bipartite/redundancy.py index 03128510..e0a519ad 100644 --- a/networkx/algorithms/bipartite/redundancy.py +++ b/networkx/algorithms/bipartite/redundancy.py @@ -1,4 +1,3 @@ -# -*- coding: utf-8 -*- """Node redundancy for bipartite graphs.""" from itertools import combinations diff --git a/networkx/algorithms/bipartite/spectral.py b/networkx/algorithms/bipartite/spectral.py index 2c53df94..823a900b 100644 --- a/networkx/algorithms/bipartite/spectral.py +++ b/networkx/algorithms/bipartite/spectral.py @@ -1,4 +1,3 @@ -# -*- coding: utf-8 -*- """ Spectral bipartivity measure. """ diff --git a/networkx/algorithms/bipartite/tests/test_spectral_bipartivity.py b/networkx/algorithms/bipartite/tests/test_spectral_bipartivity.py index 8cd56be9..0abf5929 100644 --- a/networkx/algorithms/bipartite/tests/test_spectral_bipartivity.py +++ b/networkx/algorithms/bipartite/tests/test_spectral_bipartivity.py @@ -1,4 +1,3 @@ -# -*- coding: utf-8 -*- import pytest import networkx as nx diff --git a/networkx/algorithms/bridges.py b/networkx/algorithms/bridges.py index ea34b16e..2340c9ce 100644 --- a/networkx/algorithms/bridges.py +++ b/networkx/algorithms/bridges.py @@ -1,4 +1,3 @@ -# -*- coding: utf-8 -*- """Bridge-finding algorithms.""" from itertools import chain diff --git a/networkx/algorithms/centrality/eigenvector.py b/networkx/algorithms/centrality/eigenvector.py index 51cd8b01..c5ecb658 100644 --- a/networkx/algorithms/centrality/eigenvector.py +++ b/networkx/algorithms/centrality/eigenvector.py @@ -1,4 +1,3 @@ -# -*- coding: utf-8 -*- """Functions for computing eigenvector centrality.""" from math import sqrt diff --git a/networkx/algorithms/centrality/group.py b/networkx/algorithms/centrality/group.py index 6c3cf1ed..69d6f4d2 100644 --- a/networkx/algorithms/centrality/group.py +++ b/networkx/algorithms/centrality/group.py @@ -1,4 +1,3 @@ -# -*- coding: utf-8 -*- """Group centrality measures.""" from itertools import combinations diff --git a/networkx/algorithms/centrality/load.py b/networkx/algorithms/centrality/load.py index 9d96c08f..3f07edd2 100644 --- a/networkx/algorithms/centrality/load.py +++ b/networkx/algorithms/centrality/load.py @@ -1,4 +1,3 @@ -# -*- coding: utf-8 -*- """Load centrality.""" from operator import itemgetter diff --git a/networkx/algorithms/centrality/reaching.py b/networkx/algorithms/centrality/reaching.py index dda40872..488bf480 100644 --- a/networkx/algorithms/centrality/reaching.py +++ b/networkx/algorithms/centrality/reaching.py @@ -1,4 +1,3 @@ -# -*- encoding: utf-8 -*- """Functions for computing reaching centrality of a node or a graph.""" import networkx as nx diff --git a/networkx/algorithms/centrality/second_order.py b/networkx/algorithms/centrality/second_order.py index 287edc2f..7edcf7dd 100644 --- a/networkx/algorithms/centrality/second_order.py +++ b/networkx/algorithms/centrality/second_order.py @@ -1,4 +1,3 @@ -# -*- coding: utf-8 -*- '''Copyright (c) 2015 – Thomson Licensing, SAS Redistribution and use in source and binary forms, with or without diff --git a/networkx/algorithms/centrality/subgraph_alg.py b/networkx/algorithms/centrality/subgraph_alg.py index 2fa5b714..f45cae24 100644 --- a/networkx/algorithms/centrality/subgraph_alg.py +++ b/networkx/algorithms/centrality/subgraph_alg.py @@ -1,4 +1,3 @@ -# -*- coding: utf-8 -*- """ Subraph centrality and communicability betweenness. """ diff --git a/networkx/algorithms/centrality/tests/test_katz_centrality.py b/networkx/algorithms/centrality/tests/test_katz_centrality.py index 0fdc2938..d41b05dc 100644 --- a/networkx/algorithms/centrality/tests/test_katz_centrality.py +++ b/networkx/algorithms/centrality/tests/test_katz_centrality.py @@ -1,4 +1,3 @@ -# -*- coding: utf-8 -*- import math import networkx as nx diff --git a/networkx/algorithms/chains.py b/networkx/algorithms/chains.py index 431fe09c..8796c7fe 100644 --- a/networkx/algorithms/chains.py +++ b/networkx/algorithms/chains.py @@ -1,4 +1,3 @@ -# -*- coding: utf-8 -*- """Functions for finding chains in a graph.""" import networkx as nx diff --git a/networkx/algorithms/chordal.py b/networkx/algorithms/chordal.py index da4148d5..a8a80ed4 100644 --- a/networkx/algorithms/chordal.py +++ b/networkx/algorithms/chordal.py @@ -1,4 +1,3 @@ -# -*- coding: utf-8 -*- """ Algorithms for chordal graphs. diff --git a/networkx/algorithms/cluster.py b/networkx/algorithms/cluster.py index 0bfd1bc9..f10ddec4 100644 --- a/networkx/algorithms/cluster.py +++ b/networkx/algorithms/cluster.py @@ -1,4 +1,3 @@ -# -*- coding: utf-8 -*- """Algorithms to characterize the number of triangles in a graph.""" from itertools import chain diff --git a/networkx/algorithms/coloring/equitable_coloring.py b/networkx/algorithms/coloring/equitable_coloring.py index 38b757d1..7d62ea37 100644 --- a/networkx/algorithms/coloring/equitable_coloring.py +++ b/networkx/algorithms/coloring/equitable_coloring.py @@ -1,4 +1,3 @@ -# -*- coding: utf-8 -*- """ Equitable coloring of graphs with bounded degree. """ diff --git a/networkx/algorithms/coloring/greedy_coloring.py b/networkx/algorithms/coloring/greedy_coloring.py index d2fd11c6..74bf99fe 100644 --- a/networkx/algorithms/coloring/greedy_coloring.py +++ b/networkx/algorithms/coloring/greedy_coloring.py @@ -1,4 +1,3 @@ -# -*- coding: utf-8 -*- """ Greedy graph coloring using various strategies. """ diff --git a/networkx/algorithms/coloring/tests/test_coloring.py b/networkx/algorithms/coloring/tests/test_coloring.py index 705bcde5..47cf3be6 100644 --- a/networkx/algorithms/coloring/tests/test_coloring.py +++ b/networkx/algorithms/coloring/tests/test_coloring.py @@ -1,4 +1,3 @@ -# -*- coding: utf-8 -*- """Greedy coloring test suite. """ diff --git a/networkx/algorithms/communicability_alg.py b/networkx/algorithms/communicability_alg.py index aa6ccb02..e066e373 100644 --- a/networkx/algorithms/communicability_alg.py +++ b/networkx/algorithms/communicability_alg.py @@ -1,4 +1,3 @@ -# -*- coding: utf-8 -*- """ Communicability. """ diff --git a/networkx/algorithms/community/asyn_fluid.py b/networkx/algorithms/community/asyn_fluid.py index 6ae965f9..06ea2102 100644 --- a/networkx/algorithms/community/asyn_fluid.py +++ b/networkx/algorithms/community/asyn_fluid.py @@ -1,4 +1,3 @@ -# -*- coding: utf-8 -*- """Asynchronous Fluid Communities algorithm for community detection.""" from collections import Counter diff --git a/networkx/algorithms/community/centrality.py b/networkx/algorithms/community/centrality.py index 389c97b7..e7a9e2ce 100644 --- a/networkx/algorithms/community/centrality.py +++ b/networkx/algorithms/community/centrality.py @@ -1,4 +1,3 @@ -# -*- coding: utf-8 -*- """Functions for computing communities based on centrality notions.""" import networkx as nx diff --git a/networkx/algorithms/community/community_utils.py b/networkx/algorithms/community/community_utils.py index ace129d7..c9b05002 100644 --- a/networkx/algorithms/community/community_utils.py +++ b/networkx/algorithms/community/community_utils.py @@ -1,4 +1,3 @@ -# -*- coding: utf-8 -*- """Helper functions for community-finding algorithms.""" __all__ = ['is_partition'] diff --git a/networkx/algorithms/community/kclique.py b/networkx/algorithms/community/kclique.py index 0796b9b2..e1dc8058 100644 --- a/networkx/algorithms/community/kclique.py +++ b/networkx/algorithms/community/kclique.py @@ -1,4 +1,3 @@ -# -*- coding: utf-8 -*- from collections import defaultdict import networkx as nx diff --git a/networkx/algorithms/community/kernighan_lin.py b/networkx/algorithms/community/kernighan_lin.py index 2fa684dc..ad3da951 100644 --- a/networkx/algorithms/community/kernighan_lin.py +++ b/networkx/algorithms/community/kernighan_lin.py @@ -1,4 +1,3 @@ -# -*- coding: utf-8 -*- """Functions for computing the Kernighan–Lin bipartition algorithm.""" from collections import defaultdict diff --git a/networkx/algorithms/community/label_propagation.py b/networkx/algorithms/community/label_propagation.py index 972e6927..7b5dd9d7 100644 --- a/networkx/algorithms/community/label_propagation.py +++ b/networkx/algorithms/community/label_propagation.py @@ -1,4 +1,3 @@ -# -*- coding: utf-8 -*- """ Label propagation community detection algorithms. """ diff --git a/networkx/algorithms/community/lukes.py b/networkx/algorithms/community/lukes.py index 0fd165d6..efebe15c 100644 --- a/networkx/algorithms/community/lukes.py +++ b/networkx/algorithms/community/lukes.py @@ -1,4 +1,3 @@ -# -*- coding: utf-8 -*- """Lukes Algorithm for exact optimal weighted tree partitioning.""" from copy import deepcopy diff --git a/networkx/algorithms/community/tests/test_centrality.py b/networkx/algorithms/community/tests/test_centrality.py index 2caca28b..cfd4824f 100644 --- a/networkx/algorithms/community/tests/test_centrality.py +++ b/networkx/algorithms/community/tests/test_centrality.py @@ -1,4 +1,3 @@ -# -*- coding: utf-8 -*- """Unit tests for the :mod:`networkx.algorithms.community.centrality` module. diff --git a/networkx/algorithms/community/tests/test_kernighan_lin.py b/networkx/algorithms/community/tests/test_kernighan_lin.py index 2dab6d76..8b41ff91 100644 --- a/networkx/algorithms/community/tests/test_kernighan_lin.py +++ b/networkx/algorithms/community/tests/test_kernighan_lin.py @@ -1,4 +1,3 @@ -# -*- encoding: utf-8 -*- """Unit tests for the :mod:`networkx.algorithms.community.kernighan_lin` module. diff --git a/networkx/algorithms/components/attracting.py b/networkx/algorithms/components/attracting.py index 571219f9..2df25967 100644 --- a/networkx/algorithms/components/attracting.py +++ b/networkx/algorithms/components/attracting.py @@ -1,4 +1,3 @@ -# -*- coding: utf-8 -*- """Attracting components.""" import networkx as nx from networkx.utils.decorators import not_implemented_for diff --git a/networkx/algorithms/components/biconnected.py b/networkx/algorithms/components/biconnected.py index 5f9d8a49..75042ea3 100644 --- a/networkx/algorithms/components/biconnected.py +++ b/networkx/algorithms/components/biconnected.py @@ -1,4 +1,3 @@ -# -*- coding: utf-8 -*- """Biconnected components and articulation points.""" from itertools import chain from networkx.utils.decorators import not_implemented_for diff --git a/networkx/algorithms/components/connected.py b/networkx/algorithms/components/connected.py index a7778760..024d374e 100644 --- a/networkx/algorithms/components/connected.py +++ b/networkx/algorithms/components/connected.py @@ -1,4 +1,3 @@ -# -*- coding: utf-8 -*- """Connected components.""" import networkx as nx from networkx.utils.decorators import not_implemented_for diff --git a/networkx/algorithms/components/semiconnected.py b/networkx/algorithms/components/semiconnected.py index 93a78a03..8d19f678 100644 --- a/networkx/algorithms/components/semiconnected.py +++ b/networkx/algorithms/components/semiconnected.py @@ -1,4 +1,3 @@ -# -*- coding: utf-8 -*- """Semiconnectedness.""" import networkx as nx from networkx.utils import not_implemented_for, pairwise diff --git a/networkx/algorithms/components/strongly_connected.py b/networkx/algorithms/components/strongly_connected.py index f0c0fcca..469ca9f9 100644 --- a/networkx/algorithms/components/strongly_connected.py +++ b/networkx/algorithms/components/strongly_connected.py @@ -1,4 +1,3 @@ -# -*- coding: utf-8 -*- """Strongly connected components.""" import networkx as nx from networkx.utils.decorators import not_implemented_for diff --git a/networkx/algorithms/components/weakly_connected.py b/networkx/algorithms/components/weakly_connected.py index 74d0584f..b584b8c8 100644 --- a/networkx/algorithms/components/weakly_connected.py +++ b/networkx/algorithms/components/weakly_connected.py @@ -1,4 +1,3 @@ -# -*- coding: utf-8 -*- """Weakly connected components.""" import networkx as nx from networkx.utils.decorators import not_implemented_for diff --git a/networkx/algorithms/connectivity/connectivity.py b/networkx/algorithms/connectivity/connectivity.py index 3e0023c5..5b41906d 100644 --- a/networkx/algorithms/connectivity/connectivity.py +++ b/networkx/algorithms/connectivity/connectivity.py @@ -1,4 +1,3 @@ -# -*- coding: utf-8 -*- """ Flow based connectivity algorithms """ diff --git a/networkx/algorithms/connectivity/cuts.py b/networkx/algorithms/connectivity/cuts.py index 3c044214..d1c8dc51 100644 --- a/networkx/algorithms/connectivity/cuts.py +++ b/networkx/algorithms/connectivity/cuts.py @@ -1,4 +1,3 @@ -# -*- coding: utf-8 -*- """ Flow based cut algorithms """ diff --git a/networkx/algorithms/connectivity/edge_augmentation.py b/networkx/algorithms/connectivity/edge_augmentation.py index 2ae4101d..f24c90ad 100644 --- a/networkx/algorithms/connectivity/edge_augmentation.py +++ b/networkx/algorithms/connectivity/edge_augmentation.py @@ -1,4 +1,3 @@ -# -*- coding: utf-8 -*- """ Algorithms for finding k-edge-augmentations diff --git a/networkx/algorithms/connectivity/edge_kcomponents.py b/networkx/algorithms/connectivity/edge_kcomponents.py index d38013d2..f9aa6979 100644 --- a/networkx/algorithms/connectivity/edge_kcomponents.py +++ b/networkx/algorithms/connectivity/edge_kcomponents.py @@ -1,4 +1,3 @@ -# -*- coding: utf-8 -*- """ Algorithms for finding k-edge-connected components and subgraphs. diff --git a/networkx/algorithms/connectivity/kcomponents.py b/networkx/algorithms/connectivity/kcomponents.py index c899df10..cfe6f754 100644 --- a/networkx/algorithms/connectivity/kcomponents.py +++ b/networkx/algorithms/connectivity/kcomponents.py @@ -1,4 +1,3 @@ -# -*- coding: utf-8 -*- """ Moody and White algorithm for k-components """ diff --git a/networkx/algorithms/connectivity/kcutsets.py b/networkx/algorithms/connectivity/kcutsets.py index 16995afb..614cf16f 100644 --- a/networkx/algorithms/connectivity/kcutsets.py +++ b/networkx/algorithms/connectivity/kcutsets.py @@ -1,4 +1,3 @@ -# -*- coding: utf-8 -*- """ Kanevsky all minimum node k cutsets algorithm. """ diff --git a/networkx/algorithms/connectivity/stoerwagner.py b/networkx/algorithms/connectivity/stoerwagner.py index 4cb2064a..4476e01d 100644 --- a/networkx/algorithms/connectivity/stoerwagner.py +++ b/networkx/algorithms/connectivity/stoerwagner.py @@ -1,4 +1,3 @@ -# -*- coding: utf-8 -*- """ Stoer-Wagner minimum cut algorithm. """ diff --git a/networkx/algorithms/connectivity/tests/test_edge_augmentation.py b/networkx/algorithms/connectivity/tests/test_edge_augmentation.py index 657c4ad1..3622b4d0 100644 --- a/networkx/algorithms/connectivity/tests/test_edge_augmentation.py +++ b/networkx/algorithms/connectivity/tests/test_edge_augmentation.py @@ -1,4 +1,3 @@ -# -*- coding: utf-8 -*- import random import networkx as nx import itertools as it diff --git a/networkx/algorithms/connectivity/tests/test_edge_kcomponents.py b/networkx/algorithms/connectivity/tests/test_edge_kcomponents.py index 7758a6f0..a757dd04 100644 --- a/networkx/algorithms/connectivity/tests/test_edge_kcomponents.py +++ b/networkx/algorithms/connectivity/tests/test_edge_kcomponents.py @@ -1,4 +1,3 @@ -# -*- coding: utf-8 -*- import networkx as nx import itertools as it import pytest diff --git a/networkx/algorithms/connectivity/utils.py b/networkx/algorithms/connectivity/utils.py index 729ce0a7..8a26af0a 100644 --- a/networkx/algorithms/connectivity/utils.py +++ b/networkx/algorithms/connectivity/utils.py @@ -1,4 +1,3 @@ -# -*- coding: utf-8 -*- """ Utilities for connectivity package """ diff --git a/networkx/algorithms/cuts.py b/networkx/algorithms/cuts.py index 0044b215..9fd3d02f 100644 --- a/networkx/algorithms/cuts.py +++ b/networkx/algorithms/cuts.py @@ -1,4 +1,3 @@ -# -*- coding: utf-8 -*- """Functions for finding and evaluating cuts in a graph. """ diff --git a/networkx/algorithms/dag.py b/networkx/algorithms/dag.py index 823b89aa..35342d3d 100644 --- a/networkx/algorithms/dag.py +++ b/networkx/algorithms/dag.py @@ -1,4 +1,3 @@ -# -*- coding: utf-8 -*- """Algorithms for directed acyclic graphs (DAGs). Note that most of these functions are only guaranteed to work for DAGs. diff --git a/networkx/algorithms/distance_measures.py b/networkx/algorithms/distance_measures.py index 10ce82b9..dd938898 100644 --- a/networkx/algorithms/distance_measures.py +++ b/networkx/algorithms/distance_measures.py @@ -1,4 +1,3 @@ -# -*- coding: utf-8 -*- """Graph diameter, radius, eccentricity and other properties.""" import networkx as nx diff --git a/networkx/algorithms/dominating.py b/networkx/algorithms/dominating.py index b829437b..ee976c93 100644 --- a/networkx/algorithms/dominating.py +++ b/networkx/algorithms/dominating.py @@ -1,4 +1,3 @@ -# -*- coding: utf-8 -*- """Functions for computing dominating sets in a graph.""" from itertools import chain diff --git a/networkx/algorithms/euler.py b/networkx/algorithms/euler.py index a71245b6..859f8a51 100644 --- a/networkx/algorithms/euler.py +++ b/networkx/algorithms/euler.py @@ -1,4 +1,3 @@ -# -*- coding: utf-8 -*- """ Eulerian circuits and graphs. """ diff --git a/networkx/algorithms/flow/capacityscaling.py b/networkx/algorithms/flow/capacityscaling.py index 6f6b1127..8f716770 100644 --- a/networkx/algorithms/flow/capacityscaling.py +++ b/networkx/algorithms/flow/capacityscaling.py @@ -1,4 +1,3 @@ -# -*- coding: utf-8 -*- """ Capacity scaling minimum cost flow algorithm. """ diff --git a/networkx/algorithms/flow/edmondskarp.py b/networkx/algorithms/flow/edmondskarp.py index d3a2796b..3c01b681 100644 --- a/networkx/algorithms/flow/edmondskarp.py +++ b/networkx/algorithms/flow/edmondskarp.py @@ -1,4 +1,3 @@ -# -*- coding: utf-8 -*- """ Edmonds-Karp algorithm for maximum flow problems. """ diff --git a/networkx/algorithms/flow/gomory_hu.py b/networkx/algorithms/flow/gomory_hu.py index 51da66d7..bf60376f 100644 --- a/networkx/algorithms/flow/gomory_hu.py +++ b/networkx/algorithms/flow/gomory_hu.py @@ -1,4 +1,3 @@ -# -*- coding: utf-8 -*- """ Gomory-Hu tree of undirected Graphs. """ diff --git a/networkx/algorithms/flow/maxflow.py b/networkx/algorithms/flow/maxflow.py index b3073596..c341146f 100644 --- a/networkx/algorithms/flow/maxflow.py +++ b/networkx/algorithms/flow/maxflow.py @@ -1,4 +1,3 @@ -# -*- coding: utf-8 -*- """ Maximum flow (and minimum cut) algorithms on capacitated graphs. """ diff --git a/networkx/algorithms/flow/mincost.py b/networkx/algorithms/flow/mincost.py index 440ae765..1f9e415e 100644 --- a/networkx/algorithms/flow/mincost.py +++ b/networkx/algorithms/flow/mincost.py @@ -1,4 +1,3 @@ -# -*- coding: utf-8 -*- """ Minimum cost flow algorithms on directed connected graphs. """ diff --git a/networkx/algorithms/flow/networksimplex.py b/networkx/algorithms/flow/networksimplex.py index a444fc5f..0aa972dc 100644 --- a/networkx/algorithms/flow/networksimplex.py +++ b/networkx/algorithms/flow/networksimplex.py @@ -1,4 +1,3 @@ -# -*- coding: utf-8 -*- """ Minimum cost flow algorithms on directed connected graphs. """ diff --git a/networkx/algorithms/flow/preflowpush.py b/networkx/algorithms/flow/preflowpush.py index 3e838970..fa5d99b9 100644 --- a/networkx/algorithms/flow/preflowpush.py +++ b/networkx/algorithms/flow/preflowpush.py @@ -1,4 +1,3 @@ -# -*- coding: utf-8 -*- """ Highest-label preflow-push algorithm for maximum flow problems. """ diff --git a/networkx/algorithms/flow/shortestaugmentingpath.py b/networkx/algorithms/flow/shortestaugmentingpath.py index 5c5e9146..ed1f69f1 100644 --- a/networkx/algorithms/flow/shortestaugmentingpath.py +++ b/networkx/algorithms/flow/shortestaugmentingpath.py @@ -1,4 +1,3 @@ -# -*- coding: utf-8 -*- """ Shortest augmenting path algorithm for maximum flow problems. """ diff --git a/networkx/algorithms/flow/tests/test_maxflow.py b/networkx/algorithms/flow/tests/test_maxflow.py index 9961047d..bd648ff7 100644 --- a/networkx/algorithms/flow/tests/test_maxflow.py +++ b/networkx/algorithms/flow/tests/test_maxflow.py @@ -1,4 +1,3 @@ -# -*- coding: utf-8 -*- """Maximum flow algorithms test suite. """ import pytest diff --git a/networkx/algorithms/flow/tests/test_maxflow_large_graph.py b/networkx/algorithms/flow/tests/test_maxflow_large_graph.py index 87a8f7db..e152cb50 100644 --- a/networkx/algorithms/flow/tests/test_maxflow_large_graph.py +++ b/networkx/algorithms/flow/tests/test_maxflow_large_graph.py @@ -1,4 +1,3 @@ -# -*- coding: utf-8 -*- """Maximum flow algorithms test suite on large graphs. """ diff --git a/networkx/algorithms/flow/tests/test_mincost.py b/networkx/algorithms/flow/tests/test_mincost.py index 7f48bfe1..e9383408 100644 --- a/networkx/algorithms/flow/tests/test_mincost.py +++ b/networkx/algorithms/flow/tests/test_mincost.py @@ -1,4 +1,3 @@ -# -*- coding: utf-8 -*- import networkx as nx import pytest diff --git a/networkx/algorithms/flow/utils.py b/networkx/algorithms/flow/utils.py index 9784cf0c..b15c7d14 100644 --- a/networkx/algorithms/flow/utils.py +++ b/networkx/algorithms/flow/utils.py @@ -1,4 +1,3 @@ -# -*- coding: utf-8 -*- """ Utility classes and functions for network flow algorithms. """ diff --git a/networkx/algorithms/graphical.py b/networkx/algorithms/graphical.py index 9c96605e..309ea58c 100644 --- a/networkx/algorithms/graphical.py +++ b/networkx/algorithms/graphical.py @@ -1,4 +1,3 @@ -# -*- coding: utf-8 -*- """Test sequences for graphiness. """ import heapq diff --git a/networkx/algorithms/hierarchy.py b/networkx/algorithms/hierarchy.py index 1c3548ef..71b0c307 100644 --- a/networkx/algorithms/hierarchy.py +++ b/networkx/algorithms/hierarchy.py @@ -1,4 +1,3 @@ -# -*- coding: utf-8 -*- """ Flow Hierarchy. """ diff --git a/networkx/algorithms/hybrid.py b/networkx/algorithms/hybrid.py index c39ded8c..afdfd2a2 100644 --- a/networkx/algorithms/hybrid.py +++ b/networkx/algorithms/hybrid.py @@ -1,4 +1,3 @@ -# -*- coding: utf-8 -*- """ Provides functions for finding and testing for locally `(k, l)`-connected graphs. diff --git a/networkx/algorithms/isolate.py b/networkx/algorithms/isolate.py index 44a44fc2..86c0bc1e 100644 --- a/networkx/algorithms/isolate.py +++ b/networkx/algorithms/isolate.py @@ -1,4 +1,3 @@ -# -*- encoding: utf-8 -*- """ Functions for identifying isolate (degree zero) nodes. """ diff --git a/networkx/algorithms/isomorphism/ismags.py b/networkx/algorithms/isomorphism/ismags.py index 3b922c67..01b20f6b 100644 --- a/networkx/algorithms/isomorphism/ismags.py +++ b/networkx/algorithms/isomorphism/ismags.py @@ -1,4 +1,3 @@ -# -*- coding: utf-8 -*- """ **************** ISMAGS Algorithm diff --git a/networkx/algorithms/isomorphism/isomorphvf2.py b/networkx/algorithms/isomorphism/isomorphvf2.py index 47a85979..417a49c2 100644 --- a/networkx/algorithms/isomorphism/isomorphvf2.py +++ b/networkx/algorithms/isomorphism/isomorphvf2.py @@ -1,4 +1,3 @@ -# -*- coding: utf-8 -*- """ ************* VF2 Algorithm diff --git a/networkx/algorithms/isomorphism/temporalisomorphvf2.py b/networkx/algorithms/isomorphism/temporalisomorphvf2.py index 49e4360a..8ee4f7ee 100644 --- a/networkx/algorithms/isomorphism/temporalisomorphvf2.py +++ b/networkx/algorithms/isomorphism/temporalisomorphvf2.py @@ -1,4 +1,3 @@ -# -*- coding: utf-8 -*- """ ***************************** Time-respecting VF2 Algorithm diff --git a/networkx/algorithms/isomorphism/tests/test_ismags.py b/networkx/algorithms/isomorphism/tests/test_ismags.py index a55e7ad8..cc5e25d9 100644 --- a/networkx/algorithms/isomorphism/tests/test_ismags.py +++ b/networkx/algorithms/isomorphism/tests/test_ismags.py @@ -1,4 +1,3 @@ -# -*- coding: utf-8 -*- """ Tests for ISMAGS isomorphism algorithm. """ diff --git a/networkx/algorithms/mis.py b/networkx/algorithms/mis.py index 2ea90c32..af77c0dd 100644 --- a/networkx/algorithms/mis.py +++ b/networkx/algorithms/mis.py @@ -1,4 +1,3 @@ -# -*- coding: utf-8 -*- """ Algorithm to find a maximal (not maximum) independent set. diff --git a/networkx/algorithms/moral.py b/networkx/algorithms/moral.py index bf7d6acf..48140680 100644 --- a/networkx/algorithms/moral.py +++ b/networkx/algorithms/moral.py @@ -1,4 +1,3 @@ -# -*- coding: utf-8 -*- r"""Function for computing the moral graph of a directed graph.""" from networkx.utils import not_implemented_for diff --git a/networkx/algorithms/node_classification/hmn.py b/networkx/algorithms/node_classification/hmn.py index c80d221f..a28a787f 100644 --- a/networkx/algorithms/node_classification/hmn.py +++ b/networkx/algorithms/node_classification/hmn.py @@ -1,4 +1,3 @@ -# -*- coding: utf-8 -*- """Function for computing Harmonic function algorithm by Zhu et al. References diff --git a/networkx/algorithms/node_classification/lgc.py b/networkx/algorithms/node_classification/lgc.py index 05bcc853..65b11398 100644 --- a/networkx/algorithms/node_classification/lgc.py +++ b/networkx/algorithms/node_classification/lgc.py @@ -1,4 +1,3 @@ -# -*- coding: utf-8 -*- """Function for computing Local and global consistency algorithm by Zhou et al. References diff --git a/networkx/algorithms/node_classification/utils.py b/networkx/algorithms/node_classification/utils.py index db531ec5..b54e2e07 100644 --- a/networkx/algorithms/node_classification/utils.py +++ b/networkx/algorithms/node_classification/utils.py @@ -1,4 +1,3 @@ -# -*- coding: utf-8 -*- def _propagate(P, F, B): diff --git a/networkx/algorithms/non_randomness.py b/networkx/algorithms/non_randomness.py index 1fb9fe44..c123f083 100644 --- a/networkx/algorithms/non_randomness.py +++ b/networkx/algorithms/non_randomness.py @@ -1,4 +1,3 @@ -# -*- coding: utf-8 -*- r""" Computation of graph non-randomness """ diff --git a/networkx/algorithms/reciprocity.py b/networkx/algorithms/reciprocity.py index 05eec296..c34a1131 100644 --- a/networkx/algorithms/reciprocity.py +++ b/networkx/algorithms/reciprocity.py @@ -1,4 +1,3 @@ -# -*- coding: utf-8 -*- """Algorithms to calculate reciprocity in a directed graph.""" from networkx import NetworkXError from ..utils import not_implemented_for diff --git a/networkx/algorithms/richclub.py b/networkx/algorithms/richclub.py index 76a62101..a951125b 100644 --- a/networkx/algorithms/richclub.py +++ b/networkx/algorithms/richclub.py @@ -1,4 +1,3 @@ -# -*- coding: utf-8 -*- """Functions for computing rich-club coefficients.""" import networkx as nx diff --git a/networkx/algorithms/shortest_paths/astar.py b/networkx/algorithms/shortest_paths/astar.py index 7318c3f3..b6139e2e 100644 --- a/networkx/algorithms/shortest_paths/astar.py +++ b/networkx/algorithms/shortest_paths/astar.py @@ -1,4 +1,3 @@ -# -*- coding: utf-8 -*- """Shortest paths and path lengths using the A* ("A star") algorithm. """ from heapq import heappush, heappop diff --git a/networkx/algorithms/shortest_paths/dense.py b/networkx/algorithms/shortest_paths/dense.py index c3294766..9889007b 100644 --- a/networkx/algorithms/shortest_paths/dense.py +++ b/networkx/algorithms/shortest_paths/dense.py @@ -1,4 +1,3 @@ -# -*- coding: utf-8 -*- """Floyd-Warshall algorithm for shortest paths. """ import networkx as nx diff --git a/networkx/algorithms/shortest_paths/generic.py b/networkx/algorithms/shortest_paths/generic.py index 826173ca..ceadf10d 100644 --- a/networkx/algorithms/shortest_paths/generic.py +++ b/networkx/algorithms/shortest_paths/generic.py @@ -1,4 +1,3 @@ -# -*- coding: utf-8 -*- """ Compute the shortest paths and path lengths between nodes in the graph. diff --git a/networkx/algorithms/shortest_paths/unweighted.py b/networkx/algorithms/shortest_paths/unweighted.py index 23100910..51f3da49 100644 --- a/networkx/algorithms/shortest_paths/unweighted.py +++ b/networkx/algorithms/shortest_paths/unweighted.py @@ -1,4 +1,3 @@ -# -*- coding: utf-8 -*- """ Shortest path algorithms for unweighted graphs. """ diff --git a/networkx/algorithms/shortest_paths/weighted.py b/networkx/algorithms/shortest_paths/weighted.py index 38856cfa..b255b0c0 100644 --- a/networkx/algorithms/shortest_paths/weighted.py +++ b/networkx/algorithms/shortest_paths/weighted.py @@ -1,4 +1,3 @@ -# -*- coding: utf-8 -*- """ Shortest path algorithms for weighed graphs. """ diff --git a/networkx/algorithms/similarity.py b/networkx/algorithms/similarity.py index 6ac1ab3a..985e9500 100644 --- a/networkx/algorithms/similarity.py +++ b/networkx/algorithms/similarity.py @@ -1,4 +1,3 @@ -# -*- coding: utf-8 -*- """ Functions measuring similarity using graph edit distance. The graph edit distance is the number of edge/node changes needed diff --git a/networkx/algorithms/simple_paths.py b/networkx/algorithms/simple_paths.py index 53e25a23..50e88d73 100644 --- a/networkx/algorithms/simple_paths.py +++ b/networkx/algorithms/simple_paths.py @@ -1,4 +1,3 @@ -# -*- coding: utf-8 -*- import collections from heapq import heappush, heappop from itertools import count diff --git a/networkx/algorithms/structuralholes.py b/networkx/algorithms/structuralholes.py index a7e7a7fa..cdd79970 100644 --- a/networkx/algorithms/structuralholes.py +++ b/networkx/algorithms/structuralholes.py @@ -1,4 +1,3 @@ -# -*- encoding: utf-8 -*- """Functions for computing measures of structural holes.""" import networkx as nx diff --git a/networkx/algorithms/swap.py b/networkx/algorithms/swap.py index 4eea0d28..ab330bfa 100644 --- a/networkx/algorithms/swap.py +++ b/networkx/algorithms/swap.py @@ -1,4 +1,3 @@ -# -*- coding: utf-8 -*- """Swap edges in a graph. """ diff --git a/networkx/algorithms/tree/branchings.py b/networkx/algorithms/tree/branchings.py index 8e78cfb7..e95a6918 100644 --- a/networkx/algorithms/tree/branchings.py +++ b/networkx/algorithms/tree/branchings.py @@ -1,4 +1,3 @@ -# encoding: utf-8 """ Algorithms for finding optimum branchings and spanning arborescences. diff --git a/networkx/algorithms/tree/recognition.py b/networkx/algorithms/tree/recognition.py index b0f42494..3f5e5583 100644 --- a/networkx/algorithms/tree/recognition.py +++ b/networkx/algorithms/tree/recognition.py @@ -1,4 +1,3 @@ -# -*- coding: utf-8 -*- """ Recognition Tests ================= diff --git a/networkx/algorithms/tree/tests/test_coding.py b/networkx/algorithms/tree/tests/test_coding.py index 2a023d3b..17b451b7 100644 --- a/networkx/algorithms/tree/tests/test_coding.py +++ b/networkx/algorithms/tree/tests/test_coding.py @@ -1,4 +1,3 @@ -# -*- encoding: utf-8 -*- """Unit tests for the :mod:`~networkx.algorithms.tree.coding` module.""" from itertools import product diff --git a/networkx/algorithms/tree/tests/test_mst.py b/networkx/algorithms/tree/tests/test_mst.py index 5b17d62c..b11acba6 100644 --- a/networkx/algorithms/tree/tests/test_mst.py +++ b/networkx/algorithms/tree/tests/test_mst.py @@ -1,4 +1,3 @@ -# -*- encoding: utf-8 -*- """Unit tests for the :mod:`networkx.algorithms.tree.mst` module.""" import pytest diff --git a/networkx/exception.py b/networkx/exception.py index 48b6e5d7..b121c120 100644 --- a/networkx/exception.py +++ b/networkx/exception.py @@ -1,4 +1,3 @@ -# -*- coding: utf-8 -*- """ ********** Exceptions diff --git a/networkx/generators/cographs.py b/networkx/generators/cographs.py index 4963eca8..606b0348 100644 --- a/networkx/generators/cographs.py +++ b/networkx/generators/cographs.py @@ -1,4 +1,3 @@ -# -*- coding: utf-8 -*- r"""Generators for cographs A cograph is a graph containing no path on four vertices. diff --git a/networkx/generators/degree_seq.py b/networkx/generators/degree_seq.py index 607b6184..8173d9dd 100644 --- a/networkx/generators/degree_seq.py +++ b/networkx/generators/degree_seq.py @@ -1,4 +1,3 @@ -# -*- coding: utf-8 -*- """Generate graphs with a given degree sequence or expected degree sequence. """ diff --git a/networkx/generators/directed.py b/networkx/generators/directed.py index 837c6369..2d5ceaac 100644 --- a/networkx/generators/directed.py +++ b/networkx/generators/directed.py @@ -1,4 +1,3 @@ -# -*- coding: utf-8 -*- """ Generators for some directed graphs, including growing network (GN) graphs and scale-free graphs. diff --git a/networkx/generators/expanders.py b/networkx/generators/expanders.py index 2b6d4001..d0f546de 100644 --- a/networkx/generators/expanders.py +++ b/networkx/generators/expanders.py @@ -1,4 +1,3 @@ -# -*- coding: utf-8 -*- """Provides explicit constructions of expander graphs. """ diff --git a/networkx/generators/geometric.py b/networkx/generators/geometric.py index b80b9688..3b4f4a6f 100644 --- a/networkx/generators/geometric.py +++ b/networkx/generators/geometric.py @@ -1,4 +1,3 @@ -# -*- coding: utf-8 -*- """Generators for geometric graphs. """ diff --git a/networkx/generators/harary_graph.py b/networkx/generators/harary_graph.py index fc4a3870..fbd83328 100644 --- a/networkx/generators/harary_graph.py +++ b/networkx/generators/harary_graph.py @@ -1,4 +1,3 @@ -# -*- coding: utf-8 -*- """Generators for Harary graphs This module gives two generators for the Harary graph, which was diff --git a/networkx/generators/intersection.py b/networkx/generators/intersection.py index 71923484..6680482f 100644 --- a/networkx/generators/intersection.py +++ b/networkx/generators/intersection.py @@ -1,4 +1,3 @@ -# -*- coding: utf-8 -*- """ Generators for random intersection graphs. """ diff --git a/networkx/generators/lattice.py b/networkx/generators/lattice.py index 623eae53..1262f5c0 100644 --- a/networkx/generators/lattice.py +++ b/networkx/generators/lattice.py @@ -1,4 +1,3 @@ -# -*- coding: utf-8 -*- """Functions for generating grid graphs and lattices The :func:`grid_2d_graph`, :func:`triangular_lattice_graph`, and diff --git a/networkx/generators/random_clustered.py b/networkx/generators/random_clustered.py index b920fee2..3afbf3ae 100644 --- a/networkx/generators/random_clustered.py +++ b/networkx/generators/random_clustered.py @@ -1,4 +1,3 @@ -# -*- coding: utf-8 -*- """Generate graphs with given degree and triangle sequence. """ import networkx as nx diff --git a/networkx/generators/random_graphs.py b/networkx/generators/random_graphs.py index e4b4c5a9..ff2c42a1 100644 --- a/networkx/generators/random_graphs.py +++ b/networkx/generators/random_graphs.py @@ -1,4 +1,3 @@ -# -*- coding: utf-8 -*- """ Generators for random graphs. diff --git a/networkx/generators/small.py b/networkx/generators/small.py index 16427e7f..da93aeef 100644 --- a/networkx/generators/small.py +++ b/networkx/generators/small.py @@ -1,4 +1,3 @@ -# -*- coding: utf-8 -*- """ Various small and named graphs, together with some compact generators. diff --git a/networkx/generators/tests/test_cographs.py b/networkx/generators/tests/test_cographs.py index 726e6878..d357af1a 100644 --- a/networkx/generators/tests/test_cographs.py +++ b/networkx/generators/tests/test_cographs.py @@ -1,4 +1,3 @@ -# -*- encoding: utf-8 -*- """Unit tests for the :mod:`networkx.generators.cographs` module. """ diff --git a/networkx/generators/tests/test_duplication.py b/networkx/generators/tests/test_duplication.py index d78e279e..086dd9ff 100644 --- a/networkx/generators/tests/test_duplication.py +++ b/networkx/generators/tests/test_duplication.py @@ -1,4 +1,3 @@ -# -*- encoding: utf-8 -*- """Unit tests for the :mod:`networkx.generators.duplication` module. """ diff --git a/networkx/generators/tests/test_random_graphs.py b/networkx/generators/tests/test_random_graphs.py index 036e6fe8..06eca14c 100644 --- a/networkx/generators/tests/test_random_graphs.py +++ b/networkx/generators/tests/test_random_graphs.py @@ -1,4 +1,3 @@ -# -*- encoding: utf-8 -*- """Unit tests for the :mod:`networkx.generators.random_graphs` module. """ diff --git a/networkx/generators/trees.py b/networkx/generators/trees.py index 92960c09..e1b6280b 100644 --- a/networkx/generators/trees.py +++ b/networkx/generators/trees.py @@ -1,4 +1,3 @@ -# -*- encoding: utf-8 -*- """Functions for generating trees.""" from collections import defaultdict diff --git a/networkx/linalg/algebraicconnectivity.py b/networkx/linalg/algebraicconnectivity.py index 8408cd4c..59b1e71f 100644 --- a/networkx/linalg/algebraicconnectivity.py +++ b/networkx/linalg/algebraicconnectivity.py @@ -1,4 +1,3 @@ -# -*- coding: utf-8 -*- """ Algebraic connectivity and Fiedler vectors of undirected graphs. """ diff --git a/networkx/linalg/bethehessianmatrix.py b/networkx/linalg/bethehessianmatrix.py index a3ffc598..77c90f71 100644 --- a/networkx/linalg/bethehessianmatrix.py +++ b/networkx/linalg/bethehessianmatrix.py @@ -1,4 +1,3 @@ -# -*- coding: utf-8 -*- """Bethe Hessian or deformed Laplacian matrix of graphs.""" import networkx as nx from networkx.utils import not_implemented_for diff --git a/networkx/readwrite/adjlist.py b/networkx/readwrite/adjlist.py index e23ebead..cf946c4a 100644 --- a/networkx/readwrite/adjlist.py +++ b/networkx/readwrite/adjlist.py @@ -1,4 +1,3 @@ -# -*- coding: utf-8 -*- """ ************** Adjacency List diff --git a/networkx/readwrite/gml.py b/networkx/readwrite/gml.py index 78bc6bb2..6caf4b82 100644 --- a/networkx/readwrite/gml.py +++ b/networkx/readwrite/gml.py @@ -1,4 +1,3 @@ -# encoding: utf-8 """ Read graphs in GML format. diff --git a/networkx/readwrite/json_graph/tests/test_node_link.py b/networkx/readwrite/json_graph/tests/test_node_link.py index 2b096156..75fe142e 100644 --- a/networkx/readwrite/json_graph/tests/test_node_link.py +++ b/networkx/readwrite/json_graph/tests/test_node_link.py @@ -1,4 +1,3 @@ -# -*- coding: utf-8 -*- import json import pytest import networkx as nx diff --git a/networkx/readwrite/multiline_adjlist.py b/networkx/readwrite/multiline_adjlist.py index e2e81abb..6a0e0dd9 100644 --- a/networkx/readwrite/multiline_adjlist.py +++ b/networkx/readwrite/multiline_adjlist.py @@ -1,4 +1,3 @@ -# -*- coding: utf-8 -*- """ ************************* Multi-line Adjacency List diff --git a/networkx/readwrite/tests/test_adjlist.py b/networkx/readwrite/tests/test_adjlist.py index ba9f5752..e2a655ef 100644 --- a/networkx/readwrite/tests/test_adjlist.py +++ b/networkx/readwrite/tests/test_adjlist.py @@ -1,4 +1,3 @@ -# -*- coding: utf-8 -*- """ Unit tests for adjlist. """ diff --git a/networkx/readwrite/tests/test_gml.py b/networkx/readwrite/tests/test_gml.py index 4f2090ea..f56ae2f8 100644 --- a/networkx/readwrite/tests/test_gml.py +++ b/networkx/readwrite/tests/test_gml.py @@ -1,5 +1,4 @@ #!/usr/bin/env python -# encoding: utf-8 from ast import literal_eval import codecs diff --git a/networkx/utils/mapped_queue.py b/networkx/utils/mapped_queue.py index 63c0255b..a5ff8613 100644 --- a/networkx/utils/mapped_queue.py +++ b/networkx/utils/mapped_queue.py @@ -1,4 +1,3 @@ -# -*- coding: utf-8 -*- """Priority queue class with updatable priorities. """ diff --git a/networkx/utils/tests/test_mapped_queue.py b/networkx/utils/tests/test_mapped_queue.py index f0a7b1b9..07fe1e9f 100644 --- a/networkx/utils/tests/test_mapped_queue.py +++ b/networkx/utils/tests/test_mapped_queue.py @@ -1,4 +1,3 @@ -# -*- coding: utf-8 -*- from networkx.utils.mapped_queue import MappedQueue diff --git a/networkx/utils/tests/test_misc.py b/networkx/utils/tests/test_misc.py index 42576ce0..556f0931 100644 --- a/networkx/utils/tests/test_misc.py +++ b/networkx/utils/tests/test_misc.py @@ -1,4 +1,3 @@ -# -*- encoding: utf-8 -*- import pytest import networkx as nx from networkx.utils import ( @@ -1,5 +1,4 @@ #!/usr/bin/env python -# -*- coding: utf-8 -*- """ Setup script for networkx |