Filip Hlasek def8f4937e Refactor lowest comomon ancestor. (#980) ...

* Refactor lowest comomon ancestor.

* Fix linter warnings.

* Address comments and linter warnings.

* Added Kaprekar number implementation

* updating DIRECTORY.md

* Added Collatz Conjecture implementation

* updating DIRECTORY.md

* Added Ugly Numbers implementation

* updating DIRECTORY.md

* Add lowest common ancestor to the graph namespace.

* updating DIRECTORY.md

* static tests function

* Revert ugly number kaprekar and collatz.

Co-authored-by: Deepak Vijay Agrawal <64848982+DebugAgrawal@users.noreply.github.com>
Co-authored-by: github-actions <${GITHUB_ACTOR}@users.noreply.github.com>

2020-08-14 12:35:11 -04:00

..

breadth_first_search.cpp

fix: refactor BFS algorithm. (#990)

2020-08-08 08:28:50 -04:00

bridge_finding_with_tarjan_algorithm.cpp

fix: linter warnings for bridge finding algorithm. (#991)

2020-08-07 12:40:04 -04:00

connected_components_with_dsu.cpp

Fix linter warnings for connected_components_with_dsu. (#992)

2020-08-07 12:49:12 -04:00

connected_components.cpp

…

cycle_check_directed_graph.cpp

feat: Add BFS and DFS algorithms to check for cycle in a directed graph (#816)

2020-07-19 12:06:29 -04:00

dfs_with_stack.cpp

…

dfs.cpp

…

dijkstra.cpp

…

hamiltons_cycle.cpp

[feature] hamilton cycle dynamic programming solution in O(2^n*n) time and memory (#972)

2020-07-29 13:39:13 -04:00

kosaraju.cpp

…

kruskal.cpp

…

lowest_common_ancestor.cpp

Refactor lowest comomon ancestor. (#980)

2020-08-14 12:35:11 -04:00

max_flow_with_ford_fulkerson_and_edmond_karp_algo.cpp

fix: linter for max flow. (#997)

2020-08-13 11:07:50 -04:00

prim.cpp

Using to replace typedef

2020-08-08 09:29:02 -07:00

topological_sort_by_kahns_algo.cpp

fix: linter warnings for topological_sort_by_kahns_algo (#993)

2020-08-07 12:40:44 -04:00

topological_sort.cpp

fix: linter warnings for topological_sort. (#994)

2020-08-07 12:52:44 -04:00