algorithm/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2026-03-13 09:50:19 +08:00
Code Issues Packages Projects Releases Wiki Activity

Remove useless code in doctests (#7733)

Browse Source 
* refactor: Fix matrix display deprecation

* refactor: Remove useless `print` and `pass` statements

* revert: Replace broken doctests

* [pre-commit.ci] auto fixes from pre-commit.com hooks

for more information, see https://pre-commit.ci

* revert: Fix failing doctests

* chore: Satisfy pre-commit

Co-authored-by: pre-commit-ci[bot] <66853113+pre-commit-ci[bot]@users.noreply.github.com>
This commit is contained in:
Caeden Perelli-Harris
2022-10-27 21:52:00 +01:00
committed by GitHub
parent 501a1cf0c7
commit 61eedc16c3
21 changed files with 51 additions and 61 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
graphs/minimum_spanning_tree_prims2.py
View File

@@ -69,16 +69,16 @@ class MinPriorityQueue(Generic[T]):
>>> queue.push(3, 4000)
>>> queue.push(4, 3000)
>>> print(queue.extract_min())
>>> queue.extract_min()
2
>>> queue.update_key(4, 50)
>>> print(queue.extract_min())
>>> queue.extract_min()
4
>>> print(queue.extract_min())
>>> queue.extract_min()
1
>>> print(queue.extract_min())
>>> queue.extract_min()
3
"""