Solutions to ACM/TopCoder style programming competition problems. Demonstrates a number of advanced algorithms.
RodH257/Advanced-Algorithm-Problems
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
Problems completed during QUT Advanced Algorithms unit INB365. Demonstrate a number of techinques including: - Dynamic Programming - Graph Traversal Algorithms - Shortest Path Algorithms - Convex Hull - Line Intersection - String Matching - Maximum Flow - Min Cost Max Flow - Edit Distance - Stable Marriage and more. They accept console based text input and output results to the console. Various problem statements are available in the solution.
About
Solutions to ACM/TopCoder style programming competition problems. Demonstrates a number of advanced algorithms.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published