Skip to content

Fixing lgtm issue in basic graphs #1141

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 11 commits into from
Aug 20, 2019
Merged

Fixing lgtm issue in basic graphs #1141

Changes from all commits
Commits
Show all changes
11 commits
Select commit Hold shift + click to select a range
15c9a6d
Added print function into matrix_multiplication_addition.py and remov…
qckzr Jun 10, 2019
21014db
Removed .vs/ folder per #893
qckzr Jun 10, 2019
6e2b86c
Rename matrix_multiplication_addition.py to matrix_operation.py
poyea Jun 11, 2019
6901a3c
Merge branch 'master' of git://github.com/TheAlgorithms/Python
qckzr Jun 28, 2019
031904b
Merge branch 'master' of git://github.com/TheAlgorithms/Python
qckzr Jul 6, 2019
0dde527
Merge remote-tracking branch 'upstream/master'
qckzr Jul 13, 2019
a65f73a
Merge branch 'master' of git://github.com/TheAlgorithms/Python
qckzr Jul 14, 2019
abd5cfc
Merge branch 'master' of git://github.com/TheAlgorithms/Python
qckzr Aug 5, 2019
d9f5fe2
Merge branch 'master' of git://github.com/TheAlgorithms/Python
qckzr Aug 17, 2019
e4e3c6a
Fixing lgtm issue in basic_graphs per ##1024
qckzr Aug 19, 2019
340d616
Fixed lgtm issue per @cclauss recommendation in #1024
qckzr Aug 20, 2019
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
4 changes: 3 additions & 1 deletion graphs/basic_graphs.py
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -141,7 +141,9 @@ def dijk(G, s):
from collections import deque


def topo(G, ind=None, Q=[1]):
def topo(G, ind=None, Q=None):
if Q is None:
Q = [1]
if ind is None:
ind = [0] * (len(G) + 1) # SInce oth Index is ignored
for u in G:
Expand Down