summaryrefslogtreecommitdiff
path: root/networkx/algorithms
diff options
context:
space:
mode:
authorJarrod Millman <jarrod.millman@gmail.com>2018-01-19 15:07:06 -0800
committerJarrod Millman <jarrod.millman@gmail.com>2018-01-20 01:27:28 -0800
commitea3a8826385f543775e2c6b147cbffcd289527da (patch)
treef0978401d2c4bb9cee18bc3620d92e255f8b31ae /networkx/algorithms
parent59d294f7ab3f5e894951c1e1a8a8943acaf6710b (diff)
downloadnetworkx-ea3a8826385f543775e2c6b147cbffcd289527da.tar.gz
Update copyright
Diffstat (limited to 'networkx/algorithms')
-rw-r--r--networkx/algorithms/bipartite/basic.py2
-rw-r--r--networkx/algorithms/bipartite/covering.py2
-rw-r--r--networkx/algorithms/bipartite/matrix.py2
-rw-r--r--networkx/algorithms/bipartite/projection.py2
-rw-r--r--networkx/algorithms/bipartite/tests/test_covering.py2
-rw-r--r--networkx/algorithms/boundary.py2
-rw-r--r--networkx/algorithms/bridges.py2
-rw-r--r--networkx/algorithms/centrality/betweenness.py2
-rw-r--r--networkx/algorithms/centrality/betweenness_subset.py2
-rw-r--r--networkx/algorithms/centrality/closeness.py2
-rw-r--r--networkx/algorithms/centrality/current_flow_betweenness.py2
-rw-r--r--networkx/algorithms/centrality/current_flow_betweenness_subset.py2
-rw-r--r--networkx/algorithms/centrality/current_flow_closeness.py2
-rw-r--r--networkx/algorithms/centrality/degree_alg.py2
-rw-r--r--networkx/algorithms/centrality/eigenvector.py2
-rw-r--r--networkx/algorithms/centrality/katz.py2
-rw-r--r--networkx/algorithms/centrality/load.py2
-rw-r--r--networkx/algorithms/centrality/reaching.py2
-rw-r--r--networkx/algorithms/centrality/tests/test_reaching.py2
-rw-r--r--networkx/algorithms/chains.py2
-rw-r--r--networkx/algorithms/clique.py2
-rw-r--r--networkx/algorithms/cluster.py2
-rw-r--r--networkx/algorithms/community/asyn_fluidc.py2
-rw-r--r--networkx/algorithms/community/quality.py2
-rw-r--r--networkx/algorithms/components/attracting.py2
-rw-r--r--networkx/algorithms/components/biconnected.py2
-rw-r--r--networkx/algorithms/components/connected.py2
-rw-r--r--networkx/algorithms/components/semiconnected.py2
-rw-r--r--networkx/algorithms/components/strongly_connected.py2
-rw-r--r--networkx/algorithms/components/weakly_connected.py2
-rw-r--r--networkx/algorithms/connectivity/disjoint_paths.py2
-rw-r--r--networkx/algorithms/connectivity/edge_augmentation.py2
-rw-r--r--networkx/algorithms/connectivity/edge_kcomponents.py2
-rw-r--r--networkx/algorithms/core.py2
-rw-r--r--networkx/algorithms/covering.py2
-rw-r--r--networkx/algorithms/dag.py2
-rw-r--r--networkx/algorithms/distance_measures.py2
-rw-r--r--networkx/algorithms/dominance.py2
-rw-r--r--networkx/algorithms/flow/boykovkolmogorov.py2
-rw-r--r--networkx/algorithms/flow/dinitz_alg.py2
-rw-r--r--networkx/algorithms/flow/gomory_hu.py2
-rw-r--r--networkx/algorithms/graphical.py2
-rw-r--r--networkx/algorithms/hierarchy.py2
-rw-r--r--networkx/algorithms/hybrid.py2
-rw-r--r--networkx/algorithms/isolate.py2
-rw-r--r--networkx/algorithms/isomorphism/isomorph.py2
-rw-r--r--networkx/algorithms/link_analysis/pagerank_alg.py2
-rw-r--r--networkx/algorithms/matching.py2
-rw-r--r--networkx/algorithms/operators/binary.py2
-rw-r--r--networkx/algorithms/operators/unary.py2
-rw-r--r--networkx/algorithms/reciprocity.py2
-rw-r--r--networkx/algorithms/richclub.py2
-rw-r--r--networkx/algorithms/shortest_paths/astar.py2
-rw-r--r--networkx/algorithms/shortest_paths/dense.py2
-rw-r--r--networkx/algorithms/shortest_paths/generic.py2
-rw-r--r--networkx/algorithms/shortest_paths/unweighted.py2
-rw-r--r--networkx/algorithms/shortest_paths/weighted.py2
-rw-r--r--networkx/algorithms/structuralholes.py2
-rw-r--r--networkx/algorithms/swap.py2
-rw-r--r--networkx/algorithms/tests/test_bridges.py2
-rw-r--r--networkx/algorithms/tests/test_chains.py2
-rw-r--r--networkx/algorithms/tests/test_covering.py2
-rw-r--r--networkx/algorithms/tests/test_efficiency.py2
-rw-r--r--networkx/algorithms/tests/test_mis.py2
-rw-r--r--networkx/algorithms/tests/test_voronoi.py2
-rw-r--r--networkx/algorithms/threshold.py2
-rw-r--r--networkx/algorithms/traversal/beamsearch.py2
-rw-r--r--networkx/algorithms/traversal/breadth_first_search.py2
-rw-r--r--networkx/algorithms/traversal/depth_first_search.py2
-rw-r--r--networkx/algorithms/traversal/tests/test_beamsearch.py2
-rw-r--r--networkx/algorithms/tree/coding.py2
-rw-r--r--networkx/algorithms/tree/tests/test_coding.py2
-rw-r--r--networkx/algorithms/tree/tests/test_mst.py2
-rw-r--r--networkx/algorithms/vitality.py2
-rw-r--r--networkx/algorithms/voronoi.py2
75 files changed, 75 insertions, 75 deletions
diff --git a/networkx/algorithms/bipartite/basic.py b/networkx/algorithms/bipartite/basic.py
index 077e5dd6..92116a62 100644
--- a/networkx/algorithms/bipartite/basic.py
+++ b/networkx/algorithms/bipartite/basic.py
@@ -4,7 +4,7 @@
Bipartite Graph Algorithms
==========================
"""
-# Copyright (C) 2013-2017 by
+# Copyright (C) 2013-2018 by
# Aric Hagberg <hagberg@lanl.gov>
# Dan Schult <dschult@colgate.edu>
# Pieter Swart <swart@lanl.gov>
diff --git a/networkx/algorithms/bipartite/covering.py b/networkx/algorithms/bipartite/covering.py
index 8496a85e..c4201c6d 100644
--- a/networkx/algorithms/bipartite/covering.py
+++ b/networkx/algorithms/bipartite/covering.py
@@ -1,4 +1,4 @@
-# Copyright 2016-2017 NetworkX developers.
+# Copyright 2016-2018 NetworkX developers.
# Copyright (C) 2016 by
# Nishant Nikhil <nishantiam@gmail.com>
# All rights reserved.
diff --git a/networkx/algorithms/bipartite/matrix.py b/networkx/algorithms/bipartite/matrix.py
index adaa12c5..9e57d7e8 100644
--- a/networkx/algorithms/bipartite/matrix.py
+++ b/networkx/algorithms/bipartite/matrix.py
@@ -4,7 +4,7 @@
Biadjacency matrices
====================
"""
-# Copyright (C) 2013-2017 by
+# Copyright (C) 2013-2018 by
# Aric Hagberg <hagberg@lanl.gov>
# Dan Schult <dschult@colgate.edu>
# Pieter Swart <swart@lanl.gov>
diff --git a/networkx/algorithms/bipartite/projection.py b/networkx/algorithms/bipartite/projection.py
index db7bb168..29b8ad2e 100644
--- a/networkx/algorithms/bipartite/projection.py
+++ b/networkx/algorithms/bipartite/projection.py
@@ -1,5 +1,5 @@
# -*- coding: utf-8 -*-
-# Copyright (C) 2017 by
+# Copyright (C) 2017-2018 by
# Aric Hagberg <hagberg@lanl.gov>
# Dan Schult <dschult@colgate.edu>
# Pieter Swart <swart@lanl.gov>
diff --git a/networkx/algorithms/bipartite/tests/test_covering.py b/networkx/algorithms/bipartite/tests/test_covering.py
index 25983e67..fd458161 100644
--- a/networkx/algorithms/bipartite/tests/test_covering.py
+++ b/networkx/algorithms/bipartite/tests/test_covering.py
@@ -1,4 +1,4 @@
-# Copyright 2016-2017 NetworkX developers.
+# Copyright 2016-2018 NetworkX developers.
# Copyright (C) 2016 by
# Nishant Nikhil <nishantiam@gmail.com>
# All rights reserved.
diff --git a/networkx/algorithms/boundary.py b/networkx/algorithms/boundary.py
index 2eedb575..e245bf20 100644
--- a/networkx/algorithms/boundary.py
+++ b/networkx/algorithms/boundary.py
@@ -1,4 +1,4 @@
-# Copyright (C) 2004-2017 by
+# Copyright (C) 2004-2018 by
# Aric Hagberg <hagberg@lanl.gov>
# Dan Schult <dschult@colgate.edu>
# Pieter Swart <swart@lanl.gov>
diff --git a/networkx/algorithms/bridges.py b/networkx/algorithms/bridges.py
index a56a6283..c890473b 100644
--- a/networkx/algorithms/bridges.py
+++ b/networkx/algorithms/bridges.py
@@ -1,7 +1,7 @@
# -*- coding: utf-8 -*-
# bridges.py - bridge-finding algorithms
#
-# Copyright 2004-2017 NetworkX developers.
+# Copyright 2004-2018 NetworkX developers.
#
# This file is part of NetworkX.
#
diff --git a/networkx/algorithms/centrality/betweenness.py b/networkx/algorithms/centrality/betweenness.py
index 6712ce18..e2b1604a 100644
--- a/networkx/algorithms/centrality/betweenness.py
+++ b/networkx/algorithms/centrality/betweenness.py
@@ -1,5 +1,5 @@
# coding=utf8
-# Copyright (C) 2004-2017 by
+# Copyright (C) 2004-2018 by
# Aric Hagberg <hagberg@lanl.gov>
# Dan Schult <dschult@colgate.edu>
# Pieter Swart <swart@lanl.gov>
diff --git a/networkx/algorithms/centrality/betweenness_subset.py b/networkx/algorithms/centrality/betweenness_subset.py
index b0883f3c..b5ad5ba8 100644
--- a/networkx/algorithms/centrality/betweenness_subset.py
+++ b/networkx/algorithms/centrality/betweenness_subset.py
@@ -1,4 +1,4 @@
-# Copyright (C) 2004-2017 by
+# Copyright (C) 2004-2018 by
# Aric Hagberg <hagberg@lanl.gov>
# Dan Schult <dschult@colgate.edu>
# Pieter Swart <swart@lanl.gov>
diff --git a/networkx/algorithms/centrality/closeness.py b/networkx/algorithms/centrality/closeness.py
index cf1e7ecf..0bae1208 100644
--- a/networkx/algorithms/centrality/closeness.py
+++ b/networkx/algorithms/centrality/closeness.py
@@ -1,4 +1,4 @@
-# Copyright (C) 2004-2017 by
+# Copyright (C) 2004-2018 by
# Aric Hagberg <hagberg@lanl.gov>
# Dan Schult <dschult@colgate.edu>
# Pieter Swart <swart@lanl.gov>
diff --git a/networkx/algorithms/centrality/current_flow_betweenness.py b/networkx/algorithms/centrality/current_flow_betweenness.py
index b256c1a1..0429a4fe 100644
--- a/networkx/algorithms/centrality/current_flow_betweenness.py
+++ b/networkx/algorithms/centrality/current_flow_betweenness.py
@@ -1,4 +1,4 @@
-# Copyright (C) 2010-2017 by
+# Copyright (C) 2010-2018 by
# Aric Hagberg <hagberg@lanl.gov>
# Dan Schult <dschult@colgate.edu>
# Pieter Swart <swart@lanl.gov>
diff --git a/networkx/algorithms/centrality/current_flow_betweenness_subset.py b/networkx/algorithms/centrality/current_flow_betweenness_subset.py
index 453b6974..3026652e 100644
--- a/networkx/algorithms/centrality/current_flow_betweenness_subset.py
+++ b/networkx/algorithms/centrality/current_flow_betweenness_subset.py
@@ -1,4 +1,4 @@
-# Copyright (C) 2010-2017 by
+# Copyright (C) 2010-2018 by
# Aric Hagberg <hagberg@lanl.gov>
# Dan Schult <dschult@colgate.edu>
# Pieter Swart <swart@lanl.gov>
diff --git a/networkx/algorithms/centrality/current_flow_closeness.py b/networkx/algorithms/centrality/current_flow_closeness.py
index 4606e1c2..271bc345 100644
--- a/networkx/algorithms/centrality/current_flow_closeness.py
+++ b/networkx/algorithms/centrality/current_flow_closeness.py
@@ -1,4 +1,4 @@
-# Copyright (C) 2010-2017 by
+# Copyright (C) 2010-2018 by
# Aric Hagberg <hagberg@lanl.gov>
# Dan Schult <dschult@colgate.edu>
# Pieter Swart <swart@lanl.gov>
diff --git a/networkx/algorithms/centrality/degree_alg.py b/networkx/algorithms/centrality/degree_alg.py
index 5ce5b4dc..7cb5be07 100644
--- a/networkx/algorithms/centrality/degree_alg.py
+++ b/networkx/algorithms/centrality/degree_alg.py
@@ -1,4 +1,4 @@
-# Copyright (C) 2004-2017 by
+# Copyright (C) 2004-2018 by
# Aric Hagberg <hagberg@lanl.gov>
# Dan Schult <dschult@colgate.edu>
# Pieter Swart <swart@lanl.gov>
diff --git a/networkx/algorithms/centrality/eigenvector.py b/networkx/algorithms/centrality/eigenvector.py
index d511679c..7c427605 100644
--- a/networkx/algorithms/centrality/eigenvector.py
+++ b/networkx/algorithms/centrality/eigenvector.py
@@ -1,5 +1,5 @@
# -*- coding: utf-8 -*-
-# Copyright (C) 2004-2017 by
+# Copyright (C) 2004-2018 by
# Aric Hagberg <hagberg@lanl.gov>
# Dan Schult <dschult@colgate.edu>
# Pieter Swart <swart@lanl.gov>
diff --git a/networkx/algorithms/centrality/katz.py b/networkx/algorithms/centrality/katz.py
index 03153b40..fd309e8b 100644
--- a/networkx/algorithms/centrality/katz.py
+++ b/networkx/algorithms/centrality/katz.py
@@ -1,5 +1,5 @@
# coding=utf8
-# Copyright (C) 2004-2017 by
+# Copyright (C) 2004-2018 by
# Aric Hagberg <hagberg@lanl.gov>
# Dan Schult <dschult@colgate.edu>
# Pieter Swart <swart@lanl.gov>
diff --git a/networkx/algorithms/centrality/load.py b/networkx/algorithms/centrality/load.py
index ee6b50b9..4a4f277b 100644
--- a/networkx/algorithms/centrality/load.py
+++ b/networkx/algorithms/centrality/load.py
@@ -1,5 +1,5 @@
# -*- coding: utf-8 -*-
-# Copyright (C) 2004-2017 by
+# Copyright (C) 2004-2018 by
# Aric Hagberg <hagberg@lanl.gov>
# Dan Schult <dschult@colgate.edu>
# Pieter Swart <swart@lanl.gov>
diff --git a/networkx/algorithms/centrality/reaching.py b/networkx/algorithms/centrality/reaching.py
index eb61eaa0..c8c7d1db 100644
--- a/networkx/algorithms/centrality/reaching.py
+++ b/networkx/algorithms/centrality/reaching.py
@@ -1,5 +1,5 @@
# -*- encoding: utf-8 -*-
-# Copyright (C) 2004-2017 by
+# Copyright (C) 2004-2018 by
# Aric Hagberg <hagberg@lanl.gov>
# Dan Schult <dschult@colgate.edu>
# Pieter Swart <swart@lanl.gov>
diff --git a/networkx/algorithms/centrality/tests/test_reaching.py b/networkx/algorithms/centrality/tests/test_reaching.py
index a1dd78e4..3450f349 100644
--- a/networkx/algorithms/centrality/tests/test_reaching.py
+++ b/networkx/algorithms/centrality/tests/test_reaching.py
@@ -1,4 +1,4 @@
-# Copyright (C) 2015-2017 by
+# Copyright (C) 2015-2018 by
# Aric Hagberg <hagberg@lanl.gov>
# Dan Schult <dschult@colgate.edu>
# Pieter Swart <swart@lanl.gov>
diff --git a/networkx/algorithms/chains.py b/networkx/algorithms/chains.py
index 702c3170..36804eca 100644
--- a/networkx/algorithms/chains.py
+++ b/networkx/algorithms/chains.py
@@ -1,7 +1,7 @@
# -*- coding: utf-8 -*-
# chains.py - functions for finding chains in a graph
#
-# Copyright 2004-2017 NetworkX developers.
+# Copyright 2004-2018 NetworkX developers.
#
# This file is part of NetworkX.
#
diff --git a/networkx/algorithms/clique.py b/networkx/algorithms/clique.py
index ce2592e6..8633f2ad 100644
--- a/networkx/algorithms/clique.py
+++ b/networkx/algorithms/clique.py
@@ -1,4 +1,4 @@
-# Copyright (C) 2004-2017 by
+# Copyright (C) 2004-2018 by
# Aric Hagberg <hagberg@lanl.gov>
# Dan Schult <dschult@colgate.edu>
# Pieter Swart <swart@lanl.gov>
diff --git a/networkx/algorithms/cluster.py b/networkx/algorithms/cluster.py
index 9b085667..38da2aeb 100644
--- a/networkx/algorithms/cluster.py
+++ b/networkx/algorithms/cluster.py
@@ -1,6 +1,6 @@
# -*- coding: utf-8 -*-
#
-# Copyright (C) 2004-2017 by
+# Copyright (C) 2004-2018 by
# Aric Hagberg <hagberg@lanl.gov>
# Dan Schult <dschult@colgate.edu>
# Pieter Swart <swart@lanl.gov>
diff --git a/networkx/algorithms/community/asyn_fluidc.py b/networkx/algorithms/community/asyn_fluidc.py
index ea3ce280..06c8fa12 100644
--- a/networkx/algorithms/community/asyn_fluidc.py
+++ b/networkx/algorithms/community/asyn_fluidc.py
@@ -1,5 +1,5 @@
# -*- coding: utf-8 -*-
-# Copyright (C) 2017
+# Copyright (C) 2017-2018
# All rights reserved.
# BSD license.
# Author: Ferran Parés <ferran.pares@bsc.es>
diff --git a/networkx/algorithms/community/quality.py b/networkx/algorithms/community/quality.py
index e04ff260..56963d33 100644
--- a/networkx/algorithms/community/quality.py
+++ b/networkx/algorithms/community/quality.py
@@ -1,6 +1,6 @@
# quality.py - functions for measuring partitions of a graph
#
-# Copyright 2015-2017 NetworkX developers.
+# Copyright 2015-2018 NetworkX developers.
#
# This file is part of NetworkX.
#
diff --git a/networkx/algorithms/components/attracting.py b/networkx/algorithms/components/attracting.py
index e0861f63..6245e4b6 100644
--- a/networkx/algorithms/components/attracting.py
+++ b/networkx/algorithms/components/attracting.py
@@ -1,5 +1,5 @@
# -*- coding: utf-8 -*-
-# Copyright (C) 2004-2017 by
+# Copyright (C) 2004-2018 by
# Aric Hagberg <hagberg@lanl.gov>
# Dan Schult <dschult@colgate.edu>
# Pieter Swart <swart@lanl.gov>
diff --git a/networkx/algorithms/components/biconnected.py b/networkx/algorithms/components/biconnected.py
index 58724914..c30d0d55 100644
--- a/networkx/algorithms/components/biconnected.py
+++ b/networkx/algorithms/components/biconnected.py
@@ -1,5 +1,5 @@
# -*- coding: utf-8 -*-
-# Copyright (C) 2011-2017 by
+# Copyright (C) 2011-2018 by
# Aric Hagberg <hagberg@lanl.gov>
# Dan Schult <dschult@colgate.edu>
# Pieter Swart <swart@lanl.gov>
diff --git a/networkx/algorithms/components/connected.py b/networkx/algorithms/components/connected.py
index f7ea5558..c94b3db3 100644
--- a/networkx/algorithms/components/connected.py
+++ b/networkx/algorithms/components/connected.py
@@ -1,5 +1,5 @@
# -*- coding: utf-8 -*-
-# Copyright (C) 2004-2017 by
+# Copyright (C) 2004-2018 by
# Aric Hagberg <hagberg@lanl.gov>
# Dan Schult <dschult@colgate.edu>
# Pieter Swart <swart@lanl.gov>
diff --git a/networkx/algorithms/components/semiconnected.py b/networkx/algorithms/components/semiconnected.py
index be6f35fb..2c4f191c 100644
--- a/networkx/algorithms/components/semiconnected.py
+++ b/networkx/algorithms/components/semiconnected.py
@@ -1,5 +1,5 @@
# -*- coding: utf-8 -*-
-# Copyright (C) 2004-2017 by
+# Copyright (C) 2004-2018 by
# Aric Hagberg <hagberg@lanl.gov>
# Dan Schult <dschult@colgate.edu>
# Pieter Swart <swart@lanl.gov>
diff --git a/networkx/algorithms/components/strongly_connected.py b/networkx/algorithms/components/strongly_connected.py
index 4c2e37dd..6c38437d 100644
--- a/networkx/algorithms/components/strongly_connected.py
+++ b/networkx/algorithms/components/strongly_connected.py
@@ -1,5 +1,5 @@
# -*- coding: utf-8 -*-
-# Copyright (C) 2004-2017 by
+# Copyright (C) 2004-2018 by
# Aric Hagberg <hagberg@lanl.gov>
# Dan Schult <dschult@colgate.edu>
# Pieter Swart <swart@lanl.gov>
diff --git a/networkx/algorithms/components/weakly_connected.py b/networkx/algorithms/components/weakly_connected.py
index 012e67c4..4a041a92 100644
--- a/networkx/algorithms/components/weakly_connected.py
+++ b/networkx/algorithms/components/weakly_connected.py
@@ -1,5 +1,5 @@
# -*- coding: utf-8 -*-
-# Copyright (C) 2004-2017 by
+# Copyright (C) 2004-2018 by
# Aric Hagberg <hagberg@lanl.gov>
# Dan Schult <dschult@colgate.edu>
# Pieter Swart <swart@lanl.gov>
diff --git a/networkx/algorithms/connectivity/disjoint_paths.py b/networkx/algorithms/connectivity/disjoint_paths.py
index 7feaf557..1a223d56 100644
--- a/networkx/algorithms/connectivity/disjoint_paths.py
+++ b/networkx/algorithms/connectivity/disjoint_paths.py
@@ -1,6 +1,6 @@
# disjoint_paths.py - Flow based node and edge disjoint paths.
#
-# Copyright 2017 NetworkX developers.
+# Copyright 2017-2018 NetworkX developers.
#
# This file is part of NetworkX.
#
diff --git a/networkx/algorithms/connectivity/edge_augmentation.py b/networkx/algorithms/connectivity/edge_augmentation.py
index 2f2e255a..cd8c748f 100644
--- a/networkx/algorithms/connectivity/edge_augmentation.py
+++ b/networkx/algorithms/connectivity/edge_augmentation.py
@@ -1,5 +1,5 @@
# -*- coding: utf-8 -*-
-# Copyright (C) 2004-2017 by
+# Copyright (C) 2004-2018 by
# Aric Hagberg <hagberg@lanl.gov>
# Dan Schult <dschult@colgate.edu>
# Pieter Swart <swart@lanl.gov>
diff --git a/networkx/algorithms/connectivity/edge_kcomponents.py b/networkx/algorithms/connectivity/edge_kcomponents.py
index f130145c..37bf61dc 100644
--- a/networkx/algorithms/connectivity/edge_kcomponents.py
+++ b/networkx/algorithms/connectivity/edge_kcomponents.py
@@ -1,5 +1,5 @@
# -*- coding: utf-8 -*-
-# Copyright (C) 2004-2017 by
+# Copyright (C) 2004-2018 by
# Aric Hagberg <hagberg@lanl.gov>
# Dan Schult <dschult@colgate.edu>
# Pieter Swart <swart@lanl.gov>
diff --git a/networkx/algorithms/core.py b/networkx/algorithms/core.py
index 73f017f7..699b59ca 100644
--- a/networkx/algorithms/core.py
+++ b/networkx/algorithms/core.py
@@ -1,4 +1,4 @@
-# Copyright (C) 2004-2017 by
+# Copyright (C) 2004-2018 by
# Aric Hagberg <hagberg@lanl.gov>
# Dan Schult <dschult@colgate.edu>
# Pieter Swart <swart@lanl.gov>
diff --git a/networkx/algorithms/covering.py b/networkx/algorithms/covering.py
index 43c5124c..f816c3cc 100644
--- a/networkx/algorithms/covering.py
+++ b/networkx/algorithms/covering.py
@@ -1,4 +1,4 @@
-# Copyright 2016-2017 NetworkX developers.
+# Copyright 2016-2018 NetworkX developers.
# Copyright (C) 2016 by
# Nishant Nikhil <nishantiam@gmail.com>
# All rights reserved.
diff --git a/networkx/algorithms/dag.py b/networkx/algorithms/dag.py
index 4e1c40d8..7264a05f 100644
--- a/networkx/algorithms/dag.py
+++ b/networkx/algorithms/dag.py
@@ -1,5 +1,5 @@
# -*- coding: utf-8 -*-
-# Copyright (C) 2006-2017 by
+# Copyright (C) 2006-2018 by
# Aric Hagberg <hagberg@lanl.gov>
# Dan Schult <dschult@colgate.edu>
# Pieter Swart <swart@lanl.gov>
diff --git a/networkx/algorithms/distance_measures.py b/networkx/algorithms/distance_measures.py
index d779be7c..7c2d1688 100644
--- a/networkx/algorithms/distance_measures.py
+++ b/networkx/algorithms/distance_measures.py
@@ -1,5 +1,5 @@
# -*- coding: utf-8 -*-
-# Copyright (C) 2004-2017 by
+# Copyright (C) 2004-2018 by
# Aric Hagberg <hagberg@lanl.gov>
# Dan Schult <dschult@colgate.edu>
# Pieter Swart <swart@lanl.gov>
diff --git a/networkx/algorithms/dominance.py b/networkx/algorithms/dominance.py
index 6c0d5d31..fb437af4 100644
--- a/networkx/algorithms/dominance.py
+++ b/networkx/algorithms/dominance.py
@@ -1,4 +1,4 @@
-# Copyright (C) 2014-2017 by
+# Copyright (C) 2014-2018 by
# Aric Hagberg <hagberg@lanl.gov>
# Dan Schult <dschult@colgate.edu>
# Pieter Swart <swart@lanl.gov>
diff --git a/networkx/algorithms/flow/boykovkolmogorov.py b/networkx/algorithms/flow/boykovkolmogorov.py
index 1f076787..4c834c2a 100644
--- a/networkx/algorithms/flow/boykovkolmogorov.py
+++ b/networkx/algorithms/flow/boykovkolmogorov.py
@@ -1,6 +1,6 @@
# boykovkolmogorov.py - Boykov Kolmogorov algorithm for maximum flow problems.
#
-# Copyright 2016-2017 NetworkX developers.
+# Copyright 2016-2018 NetworkX developers.
#
# This file is part of NetworkX.
#
diff --git a/networkx/algorithms/flow/dinitz_alg.py b/networkx/algorithms/flow/dinitz_alg.py
index 561f1aaa..8eb6b075 100644
--- a/networkx/algorithms/flow/dinitz_alg.py
+++ b/networkx/algorithms/flow/dinitz_alg.py
@@ -1,6 +1,6 @@
# dinitz.py - Dinitz' algorithm for maximum flow problems.
#
-# Copyright 2016-2017 NetworkX developers.
+# Copyright 2016-2018 NetworkX developers.
#
# This file is part of NetworkX.
#
diff --git a/networkx/algorithms/flow/gomory_hu.py b/networkx/algorithms/flow/gomory_hu.py
index 672eb6d0..fec99a4b 100644
--- a/networkx/algorithms/flow/gomory_hu.py
+++ b/networkx/algorithms/flow/gomory_hu.py
@@ -1,7 +1,7 @@
# -*- coding: utf-8 -*-
# gomory_hu.py - function for computing Gomory Hu trees
#
-# Copyright 2017 NetworkX developers.
+# Copyright 2017-2018 NetworkX developers.
#
# This file is part of NetworkX.
#
diff --git a/networkx/algorithms/graphical.py b/networkx/algorithms/graphical.py
index 672be201..f7064c1f 100644
--- a/networkx/algorithms/graphical.py
+++ b/networkx/algorithms/graphical.py
@@ -1,7 +1,7 @@
# -*- coding: utf-8 -*-
"""Test sequences for graphiness.
"""
-# Copyright (C) 2004-2017 by
+# Copyright (C) 2004-2018 by
# Aric Hagberg <hagberg@lanl.gov>
# Dan Schult <dschult@colgate.edu>
# Pieter Swart <swart@lanl.gov>
diff --git a/networkx/algorithms/hierarchy.py b/networkx/algorithms/hierarchy.py
index e9ff41c2..33cfbf90 100644
--- a/networkx/algorithms/hierarchy.py
+++ b/networkx/algorithms/hierarchy.py
@@ -2,7 +2,7 @@
"""
Flow Hierarchy.
"""
-# Copyright (C) 2004-2017 by
+# Copyright (C) 2004-2018 by
# Aric Hagberg <hagberg@lanl.gov>
# Dan Schult <dschult@colgate.edu>
# Pieter Swart <swart@lanl.gov>
diff --git a/networkx/algorithms/hybrid.py b/networkx/algorithms/hybrid.py
index 737988ee..56a42cd9 100644
--- a/networkx/algorithms/hybrid.py
+++ b/networkx/algorithms/hybrid.py
@@ -1,5 +1,5 @@
# -*- coding: utf-8 -*-
-# Copyright (C) 2004-2017 by
+# Copyright (C) 2004-2018 by
# Aric Hagberg <hagberg@lanl.gov>
# Dan Schult <dschult@colgate.edu>
# Pieter Swart <swart@lanl.gov>
diff --git a/networkx/algorithms/isolate.py b/networkx/algorithms/isolate.py
index 82632245..69da2f44 100644
--- a/networkx/algorithms/isolate.py
+++ b/networkx/algorithms/isolate.py
@@ -1,6 +1,6 @@
# -*- encoding: utf-8 -*-
# Copyright 2015 NetworkX developers.
-# Copyright (C) 2004-2017 by
+# Copyright (C) 2004-2018 by
# Aric Hagberg <hagberg@lanl.gov>
# Dan Schult <dschult@colgate.edu>
# Pieter Swart <swart@lanl.gov>
diff --git a/networkx/algorithms/isomorphism/isomorph.py b/networkx/algorithms/isomorphism/isomorph.py
index 08ee0c3b..d16eb875 100644
--- a/networkx/algorithms/isomorphism/isomorph.py
+++ b/networkx/algorithms/isomorphism/isomorph.py
@@ -6,7 +6,7 @@ from networkx.exception import NetworkXError
__author__ = """\n""".join(['Aric Hagberg (hagberg@lanl.gov)',
'Pieter Swart (swart@lanl.gov)',
'Christopher Ellison cellison@cse.ucdavis.edu)'])
-# Copyright (C) 2004-2017 by
+# Copyright (C) 2004-2018 by
# Aric Hagberg <hagberg@lanl.gov>
# Dan Schult <dschult@colgate.edu>
# Pieter Swart <swart@lanl.gov>
diff --git a/networkx/algorithms/link_analysis/pagerank_alg.py b/networkx/algorithms/link_analysis/pagerank_alg.py
index b924bc53..b1d83a11 100644
--- a/networkx/algorithms/link_analysis/pagerank_alg.py
+++ b/networkx/algorithms/link_analysis/pagerank_alg.py
@@ -1,5 +1,5 @@
"""PageRank analysis of graph structure. """
-# Copyright (C) 2004-2017 by
+# Copyright (C) 2004-2018 by
# Aric Hagberg <hagberg@lanl.gov>
# Dan Schult <dschult@colgate.edu>
# Pieter Swart <swart@lanl.gov>
diff --git a/networkx/algorithms/matching.py b/networkx/algorithms/matching.py
index ccf9c377..3fa6be9c 100644
--- a/networkx/algorithms/matching.py
+++ b/networkx/algorithms/matching.py
@@ -1,5 +1,5 @@
# Copyright 2016 NetworkX developers.
-# Copyright (C) 2004-2017 by
+# Copyright (C) 2004-2018 by
# Aric Hagberg <hagberg@lanl.gov>
# Dan Schult <dschult@colgate.edu>
# Pieter Swart <swart@lanl.gov>
diff --git a/networkx/algorithms/operators/binary.py b/networkx/algorithms/operators/binary.py
index fac6f99f..3f40b044 100644
--- a/networkx/algorithms/operators/binary.py
+++ b/networkx/algorithms/operators/binary.py
@@ -1,7 +1,7 @@
"""
Operations on graphs including union, intersection, difference.
"""
-# Copyright (C) 2004-2017 by
+# Copyright (C) 2004-2018 by
# Aric Hagberg <hagberg@lanl.gov>
# Dan Schult <dschult@colgate.edu>
# Pieter Swart <swart@lanl.gov>
diff --git a/networkx/algorithms/operators/unary.py b/networkx/algorithms/operators/unary.py
index ef0a1111..069f0d84 100644
--- a/networkx/algorithms/operators/unary.py
+++ b/networkx/algorithms/operators/unary.py
@@ -1,5 +1,5 @@
"""Unary operations on graphs"""
-# Copyright (C) 2004-2017 by
+# Copyright (C) 2004-2018 by
# Aric Hagberg <hagberg@lanl.gov>
# Dan Schult <dschult@colgate.edu>
# Pieter Swart <swart@lanl.gov>
diff --git a/networkx/algorithms/reciprocity.py b/networkx/algorithms/reciprocity.py
index b7ffe2c8..9eb5f1f0 100644
--- a/networkx/algorithms/reciprocity.py
+++ b/networkx/algorithms/reciprocity.py
@@ -1,5 +1,5 @@
# -*- coding: utf-8 -*-
-# Copyright (C) 2015-2017 by
+# Copyright (C) 2015-2018 by
# Aric Hagberg <hagberg@lanl.gov>
# Dan Schult <dschult@colgate.edu>
# Pieter Swart <swart@lanl.gov>
diff --git a/networkx/algorithms/richclub.py b/networkx/algorithms/richclub.py
index 7bb219be..eb239070 100644
--- a/networkx/algorithms/richclub.py
+++ b/networkx/algorithms/richclub.py
@@ -1,5 +1,5 @@
# -*- coding: utf-8 -*-
-# Copyright (C) 2004-2017 by
+# Copyright (C) 2004-2018 by
# Aric Hagberg <hagberg@lanl.gov>
# Dan Schult <dschult@colgate.edu>
# Pieter Swart <swart@lanl.gov>
diff --git a/networkx/algorithms/shortest_paths/astar.py b/networkx/algorithms/shortest_paths/astar.py
index 487ed8c4..79fa2bc7 100644
--- a/networkx/algorithms/shortest_paths/astar.py
+++ b/networkx/algorithms/shortest_paths/astar.py
@@ -1,5 +1,5 @@
# -*- coding: utf-8 -*-
-# Copyright (C) 2004-2017 by
+# Copyright (C) 2004-2018 by
# Aric Hagberg <hagberg@lanl.gov>
# Dan Schult <dschult@colgate.edu>
# Pieter Swart <swart@lanl.gov>
diff --git a/networkx/algorithms/shortest_paths/dense.py b/networkx/algorithms/shortest_paths/dense.py
index 18a6113c..67e0548d 100644
--- a/networkx/algorithms/shortest_paths/dense.py
+++ b/networkx/algorithms/shortest_paths/dense.py
@@ -1,7 +1,7 @@
# -*- coding: utf-8 -*-
"""Floyd-Warshall algorithm for shortest paths.
"""
-# Copyright (C) 2004-2017 by
+# Copyright (C) 2004-2018 by
# Aric Hagberg <hagberg@lanl.gov>
# Dan Schult <dschult@colgate.edu>
# Pieter Swart <swart@lanl.gov>
diff --git a/networkx/algorithms/shortest_paths/generic.py b/networkx/algorithms/shortest_paths/generic.py
index fe8e6852..069e9c0f 100644
--- a/networkx/algorithms/shortest_paths/generic.py
+++ b/networkx/algorithms/shortest_paths/generic.py
@@ -1,5 +1,5 @@
# -*- coding: utf-8 -*-
-# Copyright (C) 2004-2017 by
+# Copyright (C) 2004-2018 by
# Aric Hagberg <hagberg@lanl.gov>
# Dan Schult <dschult@colgate.edu>
# Pieter Swart <swart@lanl.gov>
diff --git a/networkx/algorithms/shortest_paths/unweighted.py b/networkx/algorithms/shortest_paths/unweighted.py
index 0c870c24..4eaf03b3 100644
--- a/networkx/algorithms/shortest_paths/unweighted.py
+++ b/networkx/algorithms/shortest_paths/unweighted.py
@@ -1,5 +1,5 @@
# -*- coding: utf-8 -*-
-# Copyright (C) 2004-2017 by
+# Copyright (C) 2004-2018 by
# Aric Hagberg <hagberg@lanl.gov>
# Dan Schult <dschult@colgate.edu>
# Pieter Swart <swart@lanl.gov>
diff --git a/networkx/algorithms/shortest_paths/weighted.py b/networkx/algorithms/shortest_paths/weighted.py
index 16099b45..f943bc5f 100644
--- a/networkx/algorithms/shortest_paths/weighted.py
+++ b/networkx/algorithms/shortest_paths/weighted.py
@@ -1,5 +1,5 @@
# -*- coding: utf-8 -*-
-# Copyright (C) 2004-2017 by
+# Copyright (C) 2004-2018 by
# Aric Hagberg <hagberg@lanl.gov>
# Dan Schult <dschult@colgate.edu>
# Pieter Swart <swart@lanl.gov>
diff --git a/networkx/algorithms/structuralholes.py b/networkx/algorithms/structuralholes.py
index 5d281c23..6ef43b7e 100644
--- a/networkx/algorithms/structuralholes.py
+++ b/networkx/algorithms/structuralholes.py
@@ -1,6 +1,6 @@
# -*- encoding: utf-8 -*-
#
-# Copyright 2008-2017 NetworkX developers.
+# Copyright 2008-2018 NetworkX developers.
# Aric Hagberg <hagberg@lanl.gov>
# Dan Schult <dschult@colgate.edu>
# Pieter Swart <swart@lanl.gov>
diff --git a/networkx/algorithms/swap.py b/networkx/algorithms/swap.py
index 1d296b1b..bd16a2e0 100644
--- a/networkx/algorithms/swap.py
+++ b/networkx/algorithms/swap.py
@@ -1,7 +1,7 @@
# -*- coding: utf-8 -*-
"""Swap edges in a graph.
"""
-# Copyright (C) 2004-2017 by
+# Copyright (C) 2004-2018 by
# Aric Hagberg <hagberg@lanl.gov>
# Dan Schult <dschult@colgate.edu>
# Pieter Swart <swart@lanl.gov>
diff --git a/networkx/algorithms/tests/test_bridges.py b/networkx/algorithms/tests/test_bridges.py
index bc7abd8a..2af31dee 100644
--- a/networkx/algorithms/tests/test_bridges.py
+++ b/networkx/algorithms/tests/test_bridges.py
@@ -1,6 +1,6 @@
# test_bridges.py - unit tests for bridge-finding algorithms
#
-# Copyright 2004-2017 NetworkX developers.
+# Copyright 2004-2018 NetworkX developers.
#
# This file is part of NetworkX.
#
diff --git a/networkx/algorithms/tests/test_chains.py b/networkx/algorithms/tests/test_chains.py
index 71254520..b210e6da 100644
--- a/networkx/algorithms/tests/test_chains.py
+++ b/networkx/algorithms/tests/test_chains.py
@@ -1,6 +1,6 @@
# test_chains.py - unit tests for the chains module
#
-# Copyright 2004-2017 NetworkX developers.
+# Copyright 2004-2018 NetworkX developers.
#
# This file is part of NetworkX.
#
diff --git a/networkx/algorithms/tests/test_covering.py b/networkx/algorithms/tests/test_covering.py
index 7d2c44cd..d13adbdd 100644
--- a/networkx/algorithms/tests/test_covering.py
+++ b/networkx/algorithms/tests/test_covering.py
@@ -1,4 +1,4 @@
-# Copyright 2016-2017 NetworkX developers.
+# Copyright 2016-2018 NetworkX developers.
# Copyright (C) 2016 by
# Nishant Nikhil <nishantiam@gmail.com>
# All rights reserved.
diff --git a/networkx/algorithms/tests/test_efficiency.py b/networkx/algorithms/tests/test_efficiency.py
index bc5bf4d9..e86fc550 100644
--- a/networkx/algorithms/tests/test_efficiency.py
+++ b/networkx/algorithms/tests/test_efficiency.py
@@ -1,6 +1,6 @@
# test_efficiency.py - unit tests for the efficiency module
#
-# Copyright 2015-2017 NetworkX developers.
+# Copyright 2015-2018 NetworkX developers.
#
# This file is part of NetworkX.
#
diff --git a/networkx/algorithms/tests/test_mis.py b/networkx/algorithms/tests/test_mis.py
index c73ac65c..51c3aed8 100644
--- a/networkx/algorithms/tests/test_mis.py
+++ b/networkx/algorithms/tests/test_mis.py
@@ -1,7 +1,7 @@
#!/usr/bin/env python
# -*- coding: utf-8 -*-
# $Id: test_maximal_independent_set.py 577 2011-03-01 06:07:53Z lleeoo $
-# Copyright (C) 2004-2017 by
+# Copyright (C) 2004-2018 by
# Leo Lopes <leo.lopes@monash.edu>
# Aric Hagberg <hagberg@lanl.gov>
# Dan Schult <dschult@colgate.edu>
diff --git a/networkx/algorithms/tests/test_voronoi.py b/networkx/algorithms/tests/test_voronoi.py
index a803f8e7..aab1265f 100644
--- a/networkx/algorithms/tests/test_voronoi.py
+++ b/networkx/algorithms/tests/test_voronoi.py
@@ -1,6 +1,6 @@
# test_voronoi.py - unit tests for the networkx.algorithms.voronoi module
#
-# Copyright 2016-2017 NetworkX developers.
+# Copyright 2016-2018 NetworkX developers.
#
# This file is part of NetworkX.
#
diff --git a/networkx/algorithms/threshold.py b/networkx/algorithms/threshold.py
index bbdf60d4..d8874ef7 100644
--- a/networkx/algorithms/threshold.py
+++ b/networkx/algorithms/threshold.py
@@ -1,4 +1,4 @@
-# Copyright (C) 2004-2017 by
+# Copyright (C) 2004-2018 by
# Aric Hagberg <hagberg@lanl.gov>
# Dan Schult <dschult@colgate.edu>
# Pieter Swart <swart@lanl.gov>
diff --git a/networkx/algorithms/traversal/beamsearch.py b/networkx/algorithms/traversal/beamsearch.py
index b9b462c0..509a061c 100644
--- a/networkx/algorithms/traversal/beamsearch.py
+++ b/networkx/algorithms/traversal/beamsearch.py
@@ -1,6 +1,6 @@
# beamsearch.py - breadth-first search with limited queueing
#
-# Copyright 2016-2017 NetworkX developers.
+# Copyright 2016-2018 NetworkX developers.
#
# This file is part of NetworkX.
#
diff --git a/networkx/algorithms/traversal/breadth_first_search.py b/networkx/algorithms/traversal/breadth_first_search.py
index 0fc45170..37c1f44b 100644
--- a/networkx/algorithms/traversal/breadth_first_search.py
+++ b/networkx/algorithms/traversal/breadth_first_search.py
@@ -1,6 +1,6 @@
# breadth_first_search.py - breadth-first traversal of a graph
#
-# Copyright (C) 2004-2017 NetworkX Developers
+# Copyright (C) 2004-2018 NetworkX Developers
# Aric Hagberg <hagberg@lanl.gov>
# Dan Schult <dschult@colgate.edu>
# Pieter Swart <swart@lanl.gov>
diff --git a/networkx/algorithms/traversal/depth_first_search.py b/networkx/algorithms/traversal/depth_first_search.py
index d0f4e630..4c8cbc4d 100644
--- a/networkx/algorithms/traversal/depth_first_search.py
+++ b/networkx/algorithms/traversal/depth_first_search.py
@@ -1,6 +1,6 @@
# depth_first_search.py - depth-first traversals of a graph
#
-# Copyright 2004-2017 NetworkX developers.
+# Copyright 2004-2018 NetworkX developers.
#
# This file is part of NetworkX.
#
diff --git a/networkx/algorithms/traversal/tests/test_beamsearch.py b/networkx/algorithms/traversal/tests/test_beamsearch.py
index 8d915b0a..ec68e961 100644
--- a/networkx/algorithms/traversal/tests/test_beamsearch.py
+++ b/networkx/algorithms/traversal/tests/test_beamsearch.py
@@ -1,6 +1,6 @@
# test_beamsearch.py - unit tests for the beamsearch module
#
-# Copyright 2016-2017 NetworkX developers.
+# Copyright 2016-2018 NetworkX developers.
#
# This file is part of NetworkX.
#
diff --git a/networkx/algorithms/tree/coding.py b/networkx/algorithms/tree/coding.py
index 0e155964..e781cb8f 100644
--- a/networkx/algorithms/tree/coding.py
+++ b/networkx/algorithms/tree/coding.py
@@ -2,7 +2,7 @@
#
# coding.py - functions for encoding and decoding trees as sequences
#
-# Copyright 2015-2017 NetworkX developers.
+# Copyright 2015-2018 NetworkX developers.
#
# This file is part of NetworkX.
#
diff --git a/networkx/algorithms/tree/tests/test_coding.py b/networkx/algorithms/tree/tests/test_coding.py
index 48090a0e..2909d6fe 100644
--- a/networkx/algorithms/tree/tests/test_coding.py
+++ b/networkx/algorithms/tree/tests/test_coding.py
@@ -1,7 +1,7 @@
# -*- encoding: utf-8 -*-
# test_coding.py - unit tests for the coding module
#
-# Copyright 2015-2017 NetworkX developers.
+# Copyright 2015-2018 NetworkX developers.
#
# This file is part of NetworkX.
#
diff --git a/networkx/algorithms/tree/tests/test_mst.py b/networkx/algorithms/tree/tests/test_mst.py
index 6261b682..4c17a838 100644
--- a/networkx/algorithms/tree/tests/test_mst.py
+++ b/networkx/algorithms/tree/tests/test_mst.py
@@ -1,7 +1,7 @@
# -*- encoding: utf-8 -*-
# test_mst.py - unit tests for minimum spanning tree functions
#
-# Copyright 2016-2017 NetworkX developers.
+# Copyright 2016-2018 NetworkX developers.
#
# This file is part of NetworkX.
#
diff --git a/networkx/algorithms/vitality.py b/networkx/algorithms/vitality.py
index 203524ea..e41a65c1 100644
--- a/networkx/algorithms/vitality.py
+++ b/networkx/algorithms/vitality.py
@@ -5,7 +5,7 @@
# Aric Hagberg <hagberg@lanl.gov>
# Dan Schult <dschult@colgate.edu>
# Pieter Swart <swart@lanl.gov>
-# Copyright (C) 2016-2017 by NetworkX developers.
+# Copyright (C) 2016-2018 by NetworkX developers.
#
# All rights reserved.
# BSD license.
diff --git a/networkx/algorithms/voronoi.py b/networkx/algorithms/voronoi.py
index 76d7d385..9fc7b80f 100644
--- a/networkx/algorithms/voronoi.py
+++ b/networkx/algorithms/voronoi.py
@@ -1,6 +1,6 @@
# voronoi.py - functions for computing the Voronoi partition of a graph
#
-# Copyright 2016-2017 NetworkX developers.
+# Copyright 2016-2018 NetworkX developers.
#
# This file is part of NetworkX.
#