diff options
| author | Mridul Seth <seth.mridul@gmail.com> | 2022-06-02 19:54:09 +0400 |
|---|---|---|
| committer | GitHub <noreply@github.com> | 2022-06-02 08:54:09 -0700 |
| commit | 5c0b11afb4c0882a070d522ef3fa41482ba935d3 (patch) | |
| tree | 1b8f21413afd65617420203cf834a8d15d8282ab /networkx/algorithms/tree/mst.py | |
| parent | 4dba24ba22fc8c4906e16f67b5cf103ee0a830b3 (diff) | |
| download | networkx-5c0b11afb4c0882a070d522ef3fa41482ba935d3.tar.gz | |
Use isort with pre-commit to enforce import guidelines (#5659)
* Add isort to pre-commit
* Run isort on all python files (except __init__.py ones)
Diffstat (limited to 'networkx/algorithms/tree/mst.py')
| -rw-r--r-- | networkx/algorithms/tree/mst.py | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/networkx/algorithms/tree/mst.py b/networkx/algorithms/tree/mst.py index 9af1bce4..e2ff7c62 100644 --- a/networkx/algorithms/tree/mst.py +++ b/networkx/algorithms/tree/mst.py @@ -5,9 +5,9 @@ Algorithms for calculating min/max spanning trees/forests. from dataclasses import dataclass, field from enum import Enum from heapq import heappop, heappush -from operator import itemgetter from itertools import count from math import isnan +from operator import itemgetter from queue import PriorityQueue import networkx as nx |