mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-01-31 06:33:44 +00:00
Code Issues Packages Projects Releases Wiki Activity

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

Browse Source 
for more information, see https://pre-commit.ci
This commit is contained in:
pre-commit-ci[bot] 2024-11-06 15:35:14 +00:00
parent 5a8f446281
commit 111bd6b6ee
1 changed files with 0 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

3
graphs/basic_graphs.py
View File

@ -8,7 +8,6 @@ def _input(message):
def initialize_unweighted_directed_graph( def initialize_unweighted_directed_graph(
node_count: int, edge_count: int node_count: int, edge_count: int
) -> dict[int, list[int]]: ) -> dict[int, list[int]]:
graph: dict[int, list[int]] = {} graph: dict[int, list[int]] = {}
for i in range(node_count): for i in range(node_count):
graph[i + 1] = [] graph[i + 1] = []
@ -22,7 +21,6 @@ def initialize_unweighted_directed_graph(
def initialize_unweighted_undirected_graph( def initialize_unweighted_undirected_graph(
node_count: int, edge_count: int node_count: int, edge_count: int
) -> dict[int, list[int]]: ) -> dict[int, list[int]]:
graph: dict[int, list[int]] = {} graph: dict[int, list[int]] = {}
for i in range(node_count): for i in range(node_count):
graph[i + 1] = [] graph[i + 1] = []
@ -37,7 +35,6 @@ def initialize_unweighted_undirected_graph(
def initialize_weighted_undirected_graph( def initialize_weighted_undirected_graph(
node_count: int, edge_count: int node_count: int, edge_count: int
) -> dict[int, list[tuple[int, int]]]: ) -> dict[int, list[tuple[int, int]]]:
graph: dict[int, list[tuple[int, int]]] = {} graph: dict[int, list[tuple[int, int]]] = {}
for i in range(node_count): for i in range(node_count):
graph[i + 1] = [] graph[i + 1] = []