diff options
| author | Jarrod Millman <jarrod.millman@gmail.com> | 2021-10-23 15:37:48 -0700 |
|---|---|---|
| committer | GitHub <noreply@github.com> | 2021-10-23 15:37:48 -0700 |
| commit | 0c503e31ba0062dc9a4ed47c380481aa8d6978c8 (patch) | |
| tree | ef389b7ba52dec39941978824c7e0e833f17ab9e /networkx/algorithms/distance_regular.py | |
| parent | 27d362b9a752adf38d7db1828a48f50bb41c84bd (diff) | |
| download | networkx-0c503e31ba0062dc9a4ed47c380481aa8d6978c8.tar.gz | |
Drop Py37 (#5143)
* Drop Py37
* XML serialization issue
* Use math.comb
Co-authored-by: Simone Gasperini <simone.gasperini2@studio.unibo.it>
* Run pyupgrade --py38-plus
* Run black
* More documentation
* Deprecate euclidean
Co-authored-by: Simone Gasperini <simone.gasperini2@studio.unibo.it>
Diffstat (limited to 'networkx/algorithms/distance_regular.py')
| -rw-r--r-- | networkx/algorithms/distance_regular.py | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/networkx/algorithms/distance_regular.py b/networkx/algorithms/distance_regular.py index cd2ab793..3813aa73 100644 --- a/networkx/algorithms/distance_regular.py +++ b/networkx/algorithms/distance_regular.py @@ -151,7 +151,7 @@ def intersection_array(G): raise nx.NetworkXError("Graph is not distance regular.") k = knext path_length = dict(nx.all_pairs_shortest_path_length(G)) - diameter = max([max(path_length[n].values()) for n in path_length]) + diameter = max(max(path_length[n].values()) for n in path_length) bint = {} # 'b' intersection array cint = {} # 'c' intersection array for u in G: |