TheAlgorithms-C-Plus-Plus/DIRECTORY.md
Krishna Vedala 9eca384c79
[feature] hamilton cycle dynamic programming solution in O(2^n*n) time and memory (#972)
* hamilton cycle dynamic programming solution in O(2^n*n) time and memory for n <= 20(n is number of vertices)

* tests added in hamilton-cycle

* stylistical fixes

* endline added

* assert for tests added

* some more fixes delete replaced with delete[] and comment extended od main function

* comments added like about author

* file descriptions added in hamiltons-cycle.cpp

* fix code per standards

* fix filename per repo standards

* code optimized

* updating DIRECTORY.md

* fixes: docs + optimization

* fix pre

* update main function docs

* move file from dynamic_programming to more appropriate graph

* updating DIRECTORY.md

* fix filename

* updating DIRECTORY.md

Co-authored-by: vakhokoto <v.kotoreishvili@gmail.com>
Co-authored-by: github-actions <${GITHUB_ACTOR}@users.noreply.github.com>
2020-07-29 13:39:13 -04:00

24 KiB

List of all files

Backtracking

Ciphers

Data Structures

Dynamic Programming

Geometry

Graph

Graphics

Greedy Algorithms

Hashing

Machine Learning

Math

Numerical Methods

Operations On Datastructures

Others

Probability

Range Queries

Sorting

Strings