algorithm/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-07-24 16:55:45 +08:00
Code Issues Packages Projects Releases Wiki Activity

Various ruff fixes (#12821)

Browse Source
This commit is contained in:
Christian Clauss
2025-07-06 00:35:29 +02:00
committed by GitHub
parent 7665ba5e25
commit cd3c3c3130
25 changed files with 69 additions and 70 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
graphs/minimum_spanning_tree_kruskal2.py
View File

@ -1,11 +1,11 @@
from __future__ import annotations
from typing import Generic, TypeVar
from typing import TypeVar
T = TypeVar("T")
class DisjointSetTreeNode(Generic[T]):
class DisjointSetTreeNode[T]:
# Disjoint Set Node to store the parent and rank
def __init__(self, data: T) -> None:
self.data = data
@ -13,7 +13,7 @@ class DisjointSetTreeNode(Generic[T]):
self.rank = 0
class DisjointSetTree(Generic[T]):
class DisjointSetTree[T]:
# Disjoint Set DataStructure
def __init__(self) -> None:
# map from node name to the node object
@ -46,7 +46,7 @@ class DisjointSetTree(Generic[T]):
self.link(self.find_set(data1), self.find_set(data2))
class GraphUndirectedWeighted(Generic[T]):
class GraphUndirectedWeighted[T]:
def __init__(self) -> None:
# connections: map from the node to the neighbouring nodes (with weights)
self.connections: dict[T, dict[T, int]] = {}