-
Notifications
You must be signed in to change notification settings - Fork 1k
/
main.cpp
73 lines (71 loc) · 4.44 KB
/
main.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
/*
* Copyright 2016- huaxz <[email protected]>
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 2 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*
* Author: [email protected] (huaxz)
*/
#include"src/google_test/gtest.h"
#include"src/sort_algorithms/insert_sort/insertsort_test.h"
#include"src/sort_algorithms/quick_sort/quicksort_test.h"
#include"src/sort_algorithms/merge_sort/mergesort_test.h"
#include"src/sort_algorithms/heap_sort/heapsort_test.h"
#include"src/sort_algorithms/count_sort/countsort_test.h"
#include"src/sort_algorithms/radix_sort/radixsort_test.h"
#include"src/sort_algorithms/bucket_sort/bucketsort_test.h"
#include"src/select_algorithms/randomized_select/randomizedselect_test.h"
#include"src/select_algorithms/good_select/goodselect_test.h"
#include"src/dynamic_programming_algorithms/lcs/longest_common_subsequence_test.h"
#include"src/tree_algorithms/binarytreenode/binarytreenode_test.h"
#include"src/tree_algorithms/binarytree/binarytree_test.h"
#include"src/tree_algorithms/searchtree/searchtree_test.h"
#include"src/queue_algorithms/min_queue/minqueue_test.h"
#include"src/graph_algorithms/basic_graph/graph_representation/graph_vertex/vertex_test.h"
#include"src/graph_algorithms/basic_graph/graph_representation/graph_vertex/bfs_vertex_test.h"
#include"src/graph_algorithms/basic_graph/graph_representation/graph_vertex/dfs_vertex_test.h"
#include"src/graph_algorithms/basic_graph/graph_representation/graph_vertex/set_vertex_test.h"
#include"src/graph_algorithms/basic_graph/graph_representation/graph_vertex/vertexp_test.h"
#include"src/graph_algorithms/basic_graph/graph_representation/graph_vertex/flow_vertex_test.h"
#include"src/graph_algorithms/basic_graph/graph_representation/graph_vertex/front_flow_vertex_test.h"
#include"src/graph_algorithms/basic_graph/graph_representation/graph_edge/edge_test.h"
#include"src/graph_algorithms/basic_graph/graph_representation/matrix_graph/matrixgraph_test.h"
#include"src/graph_algorithms/basic_graph/graph_representation/adjlist_graph/adjlistgraph_test.h"
#include"src/graph_algorithms/basic_graph/graph_representation/graph/graph_test.h"
#include"src/graph_algorithms/basic_graph/graph_bfs/bfs_test.h"
#include"src/graph_algorithms/basic_graph/graph_dfs/dfs_test.h"
#include"src/graph_algorithms/basic_graph/topology_sort/topologysort_test.h"
#include"src/graph_algorithms/basic_graph/strong_connected_component/strongconnectedcomponent_test.h"
#include"src/graph_algorithms/basic_graph/connected_component/connectedcomponent_test.h"
#include"src/queue_algorithms/min_queue/minqueue_test.h"
#include"src/set_algorithms/disjoint_set/disjointset_test.h"
#include"src/graph_algorithms/minimum_spanning_tree/prim/prim_test.h"
#include"src/graph_algorithms/minimum_spanning_tree/kruskal/kruskal_test.h"
#include"src/graph_algorithms/single_source_shortest_path/bellman_ford/bellmanford_test.h"
#include"src/graph_algorithms/single_source_shortest_path/dag_shortest_path/dagshortpath_test.h"
#include"src/graph_algorithms/single_source_shortest_path/dijkstra/dijkstra_test.h"
#include"src/graph_algorithms/all_node_pair_shortest_path/matrix_shortest_path/matrix_shortest_path_test.h"
#include"src/graph_algorithms/all_node_pair_shortest_path/floyd_warshall/floyd_warshall_test.h"
#include"src/graph_algorithms/all_node_pair_shortest_path/johnson/johnson_test.h"
#include"src/graph_algorithms/max_flow/ford_fulkerson/fordfulkerson_test.h"
#include"src/graph_algorithms/max_flow/generic_push_relabel/genericpushrelabel_test.h"
#include"src/graph_algorithms/max_flow/relabel_to_front/relabeltofront_test.h"
#include"src/string_matching_algorithms/regular_match/match_test.h"
#include"src/string_matching_algorithms/rabin_karp_match/rabinkarpmatch_test.h"
#include"src/string_matching_algorithms/finite_automaton_match/finiteautomatonmatch_test.h"
#include"src/string_matching_algorithms/kmp_match/kmp_test.h"
int main(int argc,char** argv)
{
::testing::InitGoogleTest(&argc,argv);
return RUN_ALL_TESTS();
}