Skip to content

c++ performance improvement #16

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
wants to merge 1 commit into
base: master
Choose a base branch
from
Open

c++ performance improvement #16

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
86 changes: 34 additions & 52 deletions cpp.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,73 +1,55 @@
#include <ctime>
#define _POSIX_C_SOURCE 200809L
#include <chrono>
#include <vector>
#include <bitset>
#include <fstream>
#include <iostream>
#include <string>
#include <chrono>

using namespace std;
using namespace std::chrono;

struct route{
int dest, cost;
int dest, cost;
};

struct node {
vector<route> neighbours;
vector<route> neighbours;
};

vector<node> readPlaces(){
ifstream text("agraph");
int numNodes; text >> numNodes;
vector<node> nodes(numNodes);
int node, neighbour, cost;
while (text >> node >> neighbour >> cost){
nodes[node].neighbours.push_back(route{neighbour, cost});
}
return nodes;
ifstream text("agraph");
string numNodesText;
text >> numNodesText;
int numNodes = stoi(numNodesText);
vector<node> nodes(numNodes);
string nodeS, neighbourS, costS;
while (text >> nodeS >> neighbourS >> costS){
nodes[stoi(nodeS)].neighbours.push_back(route{ stoi(neighbourS), stoi(costS) });
}
return nodes;
}

template <int T>
int getLongestPath(const vector<node> &nodes, const int nodeID, bitset<T> visited){
visited[nodeID] = true;
int max=0;
for(const route &neighbour: nodes[nodeID].neighbours){
if (visited[neighbour.dest] == false){
const int dist = neighbour.cost + getLongestPath<T>(nodes, neighbour.dest, visited);
if (dist > max){
max = dist;
}
}
}
visited[nodeID] = false;
return max;
}

int getLongestPath(const vector<node> &nodes)
{
if (nodes.size() <= 16) {
return getLongestPath<16>(nodes, 0, bitset<16>());
} else if (nodes.size() <= 256) {
return getLongestPath<256>(nodes, 0, bitset<256>());
} else if (nodes.size() <= 4096) {
return getLongestPath<4096>(nodes, 0, bitset<4096>());
} else if (nodes.size() <= 65536) {
return getLongestPath<65536>(nodes, 0, bitset<65536>());
} else if (nodes.size() <= 1048576) {
return getLongestPath<1048576>(nodes, 0, bitset<1048576>());
} else if (nodes.size() <= 16777216) {
return getLongestPath<16777216>(nodes, 0, bitset<16777216>());
} else {
return -1;
}
inline int getLongestPath(vector<node> &nodes, int nodeID, vector<int> &visited){
visited[nodeID] = 1;
int max = 0;
for (const route& neighbour : nodes[nodeID].neighbours){
if (visited[neighbour.dest] == 0){
int dist = neighbour.cost + getLongestPath(nodes, neighbour.dest, visited);
if (dist > max){
max = dist;
}
}
}
visited[nodeID] = 0;
return max;
}

int main(int argc, char** argv){
auto nodes = readPlaces();
auto start = high_resolution_clock::now();
int len = getLongestPath(nodes);
auto end = high_resolution_clock::now();
auto duration = (int)(0.001 * duration_cast<microseconds>(end - start).count());
cout << len << " LANGUAGE C++ " << duration << std::endl;
}
auto nodes = readPlaces();
vector<int> visited(nodes.size(), 0);
auto start = high_resolution_clock::now();
int len = getLongestPath(nodes, 0, visited);
auto duration = high_resolution_clock::now() - start;
cout << len << " LANGUAGE C++ " << duration_cast<milliseconds>(duration).count() << "\n";
}