(classical algorithms implementations) (based on linux/gcc) (correct! and ease of use, one .header file per algorithm) one .header file per algorithm. )( one demo per algorithm. )(Please Use Fork+Pull Requests !!! Correctness is the most important!)

algorithms-master
.................\.gitignore
.................\CMakeLists.txt
.................\LICENSE
.................\Makefile
.................\README.md
.................\darwin12.supp
.................\demo_graph.png
.................\include
.................\.......\2darray.h
.................\.......\8queen.h
.................\.......\LRU_cache.h
.................\.......\astar.h
.................\.......\base64.h
.................\.......\bellman_ford.h
.................\.......\binary_search_tree.h
.................\.......\bitset.h
.................\.......\bloom_filter.h
.................\.......\btree.h
.................\.......\bubble_sort.h
.................\.......\dijkstra.h
.................\.......\directed_graph.h
.................\.......\disjoint-set.h
.................\.......\dos_tree.h
.................\.......\double_linked_list.h
.................\.......\edmonds_karp.h
.................\.......\fib-heap.h
.................\.......\generic.h
.................\.......\graph_defs.h
.................\.......\graph_search.h
.................\.......\hash_code.h
.................\.......\hash_multi.h
.................\.......\hash_string.h
.................\.......\hash_table.h
.................\.......\heap.h
.................\.......\heap_sort.h
.................\.......\huffman.h
.................\.......\imath.h
.................\.......\insertion_sort.h
.................\.......\integer.h
.................\.......\interval_tree.h
.................\.......\k-means.h
.................\.......\kmp.h
.................\.......\kruskal_mst.h
.................\.......\lcs.h
.................\.......\max_subarray.h
.................\.......\md5.h
.................\.......\merge_sort.h
.................\.......\palindrome.h
.................\.......\perfect_hash.h
.................\.......\prim_mst.h
.................\.......\prime.h
.................\.......\priority_queue.h
.................\.......\queue.h
.................\.......\quick_sort.h
.................\.......\radix_sort.h
.................\.......\random.h
.................\.......\random_select.h
.................\.......\rbtree.h
.................\.......\rbtree_defs.h
.................\.......\relabel_to_front.h
.................\.......\scc.h
.................\.......\selection_sort.h
.................\.......\sha1.h
.................\.......\shuffle.h
.................\.......\simhash.h
.................\.......\skiplist.h
.................\.......\sol.h
.................\.......\sort.h
.................\.......\stack.h
.................\.......\suffix_array.h
.................\.......\suffix_tree.h
.................\.......\trie.h
.................\.......\undirected_graph.h
.................\.......\universal_hash.h
.................\.......\word_seg.h
.................\msvc
.................\....\alg_vs.h
.................\....\stdbool.h
.................\src
.................\...\8queue_demo.cpp
.................\...\LRU_cache_demo.cpp
.................\...\astar_demo.cpp
.................\...\base64_demo.cpp
.................\...\bellman_ford_demo.cpp
.................\...\binary_search_tree_demo.cpp
.................\...\bitset_demo.cpp
.................\...\bloom_filter_demo.cpp
.................\...\btree_demo.cpp
.................\...\bubble_sort_demo.cpp
.................\...\dict.txt
.................\...\dict.txt.sogou
.................\...\dijkstra_demo.cpp
.................\...\directed_graph_demo.cpp
.................\...\disjoint-set_demo.cpp
.................\...\dos_tree_demo.cpp
.................\...\double_linked_list_demo.cpp
.................\...\edmonds_karp_demo.cpp
.................\...\fib-heap_demo.cpp
.................\...\graph_demo.cpp

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．