algorithm/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-07-26 01:43:17 +08:00
Code Issues Packages Projects Releases Wiki Activity

from __future__ import annotations (#2464)

Browse Source 
* from __future__ import annotations

* fixup! from __future__ import annotations

* fixup! from __future__ import annotations

* fixup! Format Python code with psf/black push

Co-authored-by: github-actions <${GITHUB_ACTOR}@users.noreply.github.com>
This commit is contained in:
Christian Clauss
2020-09-23 13:30:13 +02:00
committed by GitHub
parent 6e6a49d19f
commit 9200a2e543
72 changed files with 275 additions and 250 deletions
Download Patch File Download Diff File Expand all files Collapse all files

9
other/markov_chain.py
View File

@ -1,6 +1,7 @@
from __future__ import annotations
from collections import Counter
from random import random
from typing import Dict, List, Tuple
class MarkovChainGraphUndirectedUnweighted:
@ -23,7 +24,7 @@ class MarkovChainGraphUndirectedUnweighted:
self.add_node(node2)
self.connections[node1][node2] = probability
def get_nodes(self) -> List[str]:
def get_nodes(self) -> list[str]:
return list(self.connections)
def transition(self, node: str) -> str:
@ -37,8 +38,8 @@ class MarkovChainGraphUndirectedUnweighted:
def get_transitions(
start: str, transitions: List[Tuple[str, str, float]], steps: int
) -> Dict[str, int]:
start: str, transitions: list[tuple[str, str, float]], steps: int
) -> dict[str, int]:
"""
Running Markov Chain algorithm and calculating the number of times each node is
visited