algorithm/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-07-05 09:21:13 +08:00
Code Issues Packages Projects Releases Wiki Activity

Pyupgrade to Python 3.9 (#4718)

Browse Source 
* Pyupgrade to Python 3.9

* updating DIRECTORY.md

Co-authored-by: github-actions <${GITHUB_ACTOR}@users.noreply.github.com>
This commit is contained in:
Christian Clauss
2021-09-07 13:37:03 +02:00
committed by GitHub
parent 5d5831bdd0
commit cecf43d648
142 changed files with 523 additions and 530 deletions
Download Patch File Download Diff File Expand all files Collapse all files

21
project_euler/problem_107/sol1.py
View File

@ -27,11 +27,12 @@ Solution:
We use Prim's algorithm to find a Minimum Spanning Tree.
Reference: https://en.wikipedia.org/wiki/Prim%27s_algorithm
"""
from __future__ import annotations
import os
from typing import Dict, List, Mapping, Set, Tuple
from typing import Mapping
EdgeT = Tuple[int, int]
EdgeT = tuple[int, int]
class Graph:
@ -39,9 +40,9 @@ class Graph:
A class representing an undirected weighted graph.
"""
def __init__(self, vertices: Set[int], edges: Mapping[EdgeT, int]) -> None:
self.vertices: Set[int] = vertices
self.edges: Dict[EdgeT, int] = {
def __init__(self, vertices: set[int], edges: Mapping[EdgeT, int]) -> None:
self.vertices: set[int] = vertices
self.edges: dict[EdgeT, int] = {
(min(edge), max(edge)): weight for edge, weight in edges.items()
}
@ -59,7 +60,7 @@ class Graph:
self.vertices.add(edge[1])
self.edges[(min(edge), max(edge))] = weight
def prims_algorithm(self) -> "Graph":
def prims_algorithm(self) -> Graph:
"""
Run Prim's algorithm to find the minimum spanning tree.
Reference: https://en.wikipedia.org/wiki/Prim%27s_algorithm
@ -98,13 +99,13 @@ def solution(filename: str = "p107_network.txt") -> int:
"""
script_dir: str = os.path.abspath(os.path.dirname(__file__))
network_file: str = os.path.join(script_dir, filename)
adjacency_matrix: List[List[str]]
edges: Dict[EdgeT, int] = dict()
data: List[str]
adjacency_matrix: list[list[str]]
edges: dict[EdgeT, int] = dict()
data: list[str]
edge1: int
edge2: int
with open(network_file, "r") as f:
with open(network_file) as f:
data = f.read().strip().split("\n")
adjaceny_matrix = [line.split(",") for line in data]