-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathmain.cpp
More file actions
44 lines (33 loc) · 1007 Bytes
/
main.cpp
File metadata and controls
44 lines (33 loc) · 1007 Bytes
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
//
// main.cpp
// workplace
//
// Created by Andrii Bugaiov on 2015-01-28.
// Copyright (c) 2015 MyCompany. All rights reserved.
//
#include <iostream>
#include "ABGraphAlgorithm.h"
#include "ABUndirectedGraph.h"
#include "ABHeapTreeAlgorithm.h"
#include "ABHeapTree.h"
#include "ABHashTableAlgorithm.h"
#include "ABHashTable.h"
using namespace std;
int main()
{
#if 0
ABUndirectedGraph g;
const char *fileName = DIJKSTRAS_SHORTEST_PATH_ALGORITHM;
g.loadGraph(fileName);
ABDijkstrasShortestPathAlgorithm(g);
const char *fileName = MEDIAN_MAINTENANCE_PROBLEM;
long long mediansSum = ABMediansSumComputingAlgorithm(fileName);
cout << "The sum of the medians modulo 10000 is - " << mediansSum % 10000 << endl;
const char *fileName = TWO_SUM_PROBLEM;
int counter = ABTwoSumComputingAlgorithm(fileName);
cout << "The two-sum count is - " << counter << endl;
#endif
const char *fileName = MEDIAN_MAINTENANCE_PROBLEM;
ABLinearHeapifyAlgorithm(fileName);
return 0;
}