Skip to content
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

implementation of algorithms: Dijkstra's, compare binary trees, invert binary tree, reverse linked list #181

Merged
merged 7 commits into from
Jan 3, 2025

Conversation

mzarnecki
Copy link
Contributor

This pull request contains implementation of algorithms:

  • Dijkstra's
  • compare binary trees
  • invert binary tree
  • reverse linked list

and small refactoring for Bellman-Ford algorithm implementation

@mzarnecki
Copy link
Contributor Author

@darwinz could you take a look at this PR when you have a moment?
I added some algorithms related binary trees, linked list and graph shortest path.
There is also second PR with neural network perceptron algorithm written in PHP.

Copy link
Contributor

@darwinz darwinz left a comment

Choose a reason for hiding this comment

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

This is a great addition. Thanks for adding it!

@darwinz darwinz merged commit beb386c into TheAlgorithms:master Jan 3, 2025
2 checks passed
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.

2 participants