cocacolacat / algorithms Goto Github PK

######How to run

• bfs: gcc ./src/graph/bfs.c -o ./bin/bfs && ./bin/bfs
• dfs: gcc ./src/graph/dfs.c -o ./bin/dfs && ./bin/dfs
• paths detection: gcc ./src/graph/path_detection.c -o ./bin/path_detection && ./bin/path_detection
• shortest paths: gcc ./src/graph/shortest_path.c -o ./bin/shortest_path && ./bin/shortest_path
• cycle detection: gcc ./src/graph/dc_detection.c -o ./bin/dc_detection && ./bin/dc_detection
• cycle detection version 2: gcc ./src/graph/dc_detection_v2.c -o ./bin/dc_detection_v2 && ./bin/dc_detection_v2
• topological sort: gcc ./src/graph/topological_sort.c -o ./bin/topological_sort && ./bin/topological_sort
• minimal spanning tree: gcc ./src/graph/mst.c -o ./bin/mst && ./bin/mst
• Kruskal’s minimal spanning tree: gcc ./src/graph/mst_k.c -o ./bin/mst_k && ./bin/mst_k
• gcc ./src/graph/weight_graph_and_priority_queue.c -g -o ./bin/weight_graph_and_priority_queue && ./bin/weight_graph_and_priority_queue
• union find(quick find): gcc ./src/data_structure/union_set.c -o ./bin/union_set && ./bin/union_set
• union find(quick union): gcc ./src/data_structure/union_set_v2.c -o ./bin/union_set_v2 && ./bin/union_set_v2
• indexed min priority queue: gcc ./src/data_structure/indexed_min_priority_queue.c -o ./bin/indexed_min_priority_queue && ./bin/indexed_min_priority_queue
• directed_weight_graph: gcc ./src/data_structure/directed_weight_graph.c -o ./bin/directed_weight_graph && ./bin/directed_weight_graph
• shortest spanning tree: gcc ./src/graph/spt.c -o ./bin/spt && ./bin/spt
• binary search tree: gcc ./src/data_structure/binary_search_tree.c -o ./bin/binary_search_tree && ./bin/binary_search_tree
• red black tree: gcc ./src/searching_algorithms/red_black_tree.c -o ./bin/red_black_tree && ./bin/red_black_tree
• least significant digit first: gcc ./src/string/ldf.c -o ./bin/ldf && ./bin/ldf
• most significant digit first: gcc ./src/string/mdf.c -o ./bin/mdf && ./bin/mdf
• KMP: gcc ./src/string/kmp.c -o ./bin/kmp && ./bin/kmp
• edit distance: gcc ./src/dp/edit_distance.c -o ./bin/edit_distance && ./bin/edit_distance
• longest increasing subsequence: gcc ./src/dp/longest_increasing_subsequence.c -o ./bin/longest_increasing_subsequence && ./bin/longest_increasing_subsequence
• longest increasing subsequence in logn: gcc ./src/dp/lis_lgn.c -o ./bin/lis_lgn && ./bin/lis_lgn