Where I implemented divide-and-conquer algorithms, graph decomposition, paths in graphs, greedy algorithms, dynamic programming, linear programming, the theory of NP-completeness, and approaches to coping with NP-complete problems in Python.
-
Notifications
You must be signed in to change notification settings - Fork 0
Implemented divide-and-conquer algorithms, graph decomposition, paths in graphs, greedy algorithms, dynamic programming, linear programming, the theory of NP-completeness, and approaches to coping with NP-complete problems.
1anza/Algorithms
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Implemented divide-and-conquer algorithms, graph decomposition, paths in graphs, greedy algorithms, dynamic programming, linear programming, the theory of NP-completeness, and approaches to coping with NP-complete problems.
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published