kk-r
/ graph_traversal_template.py
Created
August 11, 2021 12:33
— forked from RuolinZheng08/graph_traversal_template.py
[Algo] Graph Traversal Template
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| # Iterative | |
| def dfs(graph, start): | |
| visited, stack = set(), [start] | |
| while stack: | |
| node = stack.pop() | |
| visited.add(node) | |
| for neighbor in graph[node]: | |
| if not neighbor in visited: | |
| stack.append(neighbor) | |
| return visited |
kk-r
/ tree_traversal_template.py
Created
August 11, 2021 12:33
— forked from RuolinZheng08/tree_traversal_template.py
[Algo] Tree Traversal Template
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| # DFS | |
| def preorder(self, root): | |
| if not root: | |
| return [] | |
| ret = [] | |
| stack = [root] | |
| while stack: | |
| node = stack.pop() | |
| ret.append(node.val) | |
| if node.right: |
kk-r
/ backtracking_template.py
Created
August 11, 2021 12:33
— forked from RuolinZheng08/backtracking_template.py
[Algo] Backtracking Template & N-Queens Solution
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| def is_valid_state(state): | |
| # check if it is a valid solution | |
| return True | |
| def get_candidates(state): | |
| return [] | |
| def search(state, solutions): | |
| if is_valid_state(state): | |
| solutions.append(state.copy()) |