mirror of
https://github.com/TheAlgorithms/Python.git
synced 2026-03-13 09:50:19 +08:00
isort --profile black . (#2181)
* updating DIRECTORY.md
* isort --profile black .
* Black after
* updating DIRECTORY.md
Co-authored-by: github-actions <${GITHUB_ACTOR}@users.noreply.github.com>
This commit is contained in:
@@ -1,6 +1,5 @@
|
||||
from collections import deque
|
||||
|
||||
|
||||
if __name__ == "__main__":
|
||||
# Accept No. of Nodes and edges
|
||||
n, m = map(int, input().split(" "))
|
||||
|
||||
@@ -12,8 +12,7 @@ while Q is non-empty:
|
||||
mark w as explored
|
||||
add w to Q (at the end)
|
||||
"""
|
||||
|
||||
from typing import Set, Dict
|
||||
from typing import Dict, Set
|
||||
|
||||
G = {
|
||||
"A": ["B", "C"],
|
||||
|
||||
@@ -11,8 +11,7 @@ Pseudocode:
|
||||
if v unexplored:
|
||||
DFS(G, v)
|
||||
"""
|
||||
|
||||
from typing import Set, Dict
|
||||
from typing import Dict, Set
|
||||
|
||||
|
||||
def depth_first_search(graph: Dict, start: str) -> Set[int]:
|
||||
|
||||
@@ -1,7 +1,7 @@
|
||||
from collections import deque
|
||||
import random as rand
|
||||
import math as math
|
||||
import random as rand
|
||||
import time
|
||||
from collections import deque
|
||||
|
||||
# the default weight is 1 if not assigned but all the implementation is weighted
|
||||
|
||||
|
||||
@@ -1,4 +1,5 @@
|
||||
import heapq
|
||||
|
||||
import numpy as np
|
||||
|
||||
|
||||
|
||||
Reference in New Issue
Block a user