Skip to content

Added Markov Chain #2146

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 2 commits into from
Jun 23, 2020
Merged

Added Markov Chain #2146

merged 2 commits into from
Jun 23, 2020

Conversation

ruppysuppy
Copy link
Member

Describe your change:

  • Add an algorithm?
  • Fix a bug or typo in an existing algorithm?
  • Documentation change?

Checklist:

  • I have read CONTRIBUTING.md.
  • This pull request is all my own work -- I have not plagiarized.
  • I know that pull requests will not be merged if they fail the automated tests.
  • This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
  • All new Python files are placed inside an existing directory.
  • All filenames are in all lowercase characters with no spaces or dashes.
  • All functions and variable names follow Python naming conventions.
  • All function parameters and return values are annotated with Python type hints.
  • All functions have doctests that pass the automated testing.
  • All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
  • Fixes: We are lacking some algorithms from simulations #1613

self.connections[node1][node2] = probability

def get_nodes(self) -> List[str]:
return list(self.connections.keys())
Copy link
Member

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Suggested change
return list(self.connections.keys())
return list(self.connections)

.keys() is almost never needed in modern Python.


>>> result = get_transitions('a', transitions, 5000)

>>> assert result['a'] > result['b'] > result['c']
Copy link
Member

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Suggested change
>>> assert result['a'] > result['b'] > result['c']
>>> result['a'] > result['b'] > result['c']
True

for node1, node2, probability in transitions:
graph.add_transition_probability(node1, node2, probability)

visited = {node: 0 for node in graph.get_nodes()}
Copy link
Member

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Suggested change
visited = {node: 0 for node in graph.get_nodes()}
visited = collections.Counter()

(import collections at top of file)

https://docs.python.org/3/library/collections.html#collections.Counter

@cclauss cclauss merged commit f1ce2d6 into TheAlgorithms:master Jun 23, 2020
stokhos pushed a commit to stokhos/Python that referenced this pull request Jan 3, 2021
* Added Markov Chain

* Implemented suggestions
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

We are lacking some algorithms from simulations
2 participants