GitLab

+ Sitemap generator I created while learning the dispose pattern
+ Testing project for learning general C#

+ totalWeight is now tracked for BFS & DFS traversals
+ Refactor graph search info structs

+ Add example for race condition problem / solution

+ Resolve all warnings

+ Rename output executables to match directory structure
+ Remove libraries for small examples
+ Supress -Wreturn-type warnings for singleton that is intentionally not copyable

+ Update READMEs

+ Neural network CLI
+ Hidden Markov Model CLI
+ K-Means clustering CLI
+ Linear regression CLI
+ Screenshots, updated README instructions

+ Rename `cmake` -> `cmake-example`

+ Fix incorrect library name for `algorithms/trees/BST` example
+ Update root CMakeLists.txt for major directories to set binary path
+ Add instructions to install CMake LTS with pip

+ Use inheritance to provide base class for key based ciphers

+ Can be used for a single host or a group of hosts
+ Update nginx-nobinary jail regex

+ Add keyWord and message validation in columnar-transposition example
+ Add quotes around output to help show leading / trailing spaces

+ Add example using columnar transposition for encrypting / decrypting messages
+ Fix cmake build error from duplicate lib-bst when building from project root

+ Using example graph and pseudocode from MIT Algorithms

+ Allows Graph member functions to remain const
+ Easy to pass traversal information around as needed
+ Update DFS and BFS functions to return traversal information

+ Allows result of topological sort to match examples shown in MIT Algorithms
+ Correct order of initialization for all graphs and adjacent nodes in graph.cpp
+ Provide overloaded DFS for beginning at a specific node within the graph

+ Clean code, add overloaded functions and helper functions for common tasks

+ Allows traversal and topological sort algorithms to show examples from MIT Algorithms more accurately

+ Using pseudocode examples from MIT Intro to Algorithms

+ Add comments to explain when to offset and when to use key values

+ Using pseudocode examples from MIT Intro to Algorithms

+ Utilize copy-swap idiom, miscellaneous clean-up of conditions and return values

+ Use copy-swap idiom for assignment operators
+ Update and organize CMakeLists subdirectories for algorithm examples

+ Using pseudocode examples from MIT Introduction to Algorithms

+ Using the pseudocode examples from MIT introduction to algorithms