forked from leo000leo/Algorithm
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathmain.cpp
More file actions
41 lines (37 loc) · 1.06 KB
/
Copy pathmain.cpp
File metadata and controls
41 lines (37 loc) · 1.06 KB
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
//
// main.cpp
// Algorithm
//
// Created by dtysky on 16/8/22.
// Copyright © 2016年 [email protected]. All rights reserved.
//
#include "main.h"
//#include "selection_sort.test.h"
//#include "insertion_sort.test.h"
//#include "bucket_sort.test.h"
//#include "radix_sort.test.h"
//#include "shell_sort.test.h"
//#include "merge_sort.test.h"
//#include "quick_sort.test.h"
//#include "heap_sort.test.h"
#include "weighted_digraph_algorithm.test.h"
int main(int argc, const char * argv[]) {
// printf("quick\n");
// my_algorithm::testQuickSort();
// printf("\nmerge\n");
// my_algorithm::testMergeSort();
// printf("\nshell\n");
// my_algorithm::testShellSort();
// printf("\ninsertion\n");
// my_algorithm::testInsertionSort();
// printf("\nselection\n");
// my_algorithm::testSelectionSort();
// printf("\nbucket\n");
// my_algorithm::testBucketSort();
// printf("\nradix\n");
// my_algorithm::testRadixSort();
// printf("\nheap\n");
// my_algorithm::testHeapSort();
my_algorithm::testWeightDigraphAlgorithm();
return 0;
}