Add files

Author: pankdm

.gitignore

@@ -1,3 +1,8 @@
+# build folders
+bin/
+build/
+cython/build/
+
 # Prerequisites
 *.d
 

Workbook.xlsx

@@ -0,0 +1,79 @@
+
+import json
+import os
+import subprocess
+
+
+RESULTS_FILE = "results.txt"
+
+RUN_SCRIPTS = {
+    "cpp": "./cpp/run.sh",
+    "python": "./python/run.sh",
+    "python3": "./python/run_python3.sh",
+    "kotlin": "./kotlin/run.sh",
+    "kotlin_jit": "./kotlin/run_jit.sh",
+    "kotlin_jit_5": "./kotlin/run_jit_5.sh",
+    "cython_bfs": "./cython/run.sh",
+    "cython_full": "./cython/run_full.sh",
+}
+
+
+def extract_tags(lines):
+    result = {}
+    for line in lines.split('\n'):
+        if "=" in line:
+            k, v = line.split("=")
+            result[k] = v
+    return result
+
+
+def run_benchmark(name, map_name):
+    path = 'txt-maps/{}'.format(map_name)
+    script = RUN_SCRIPTS[name]
+    stdout = subprocess.check_output([script, path])
+    tags = extract_tags(stdout)
+    tags['map'] = map_name
+    tags['name'] = name
+    print(tags)
+    return tags
+
+
+def write_to_file(data):
+    f = open(RESULTS_FILE, 'a')
+    f.write(json.dumps(data) + '\n')
+    f.close()
+
+
+def get_map_tags(map_name):
+    f = open('maps/{}'.format(map_name.replace(".txt", ".json")))
+    data = json.load(f)
+    return {
+        'nodes': len(data['sites']),
+        'edges': len(data['rivers']),
+    }
+
+
+def all_benchmarks():
+    # clean the file
+    f = open(RESULTS_FILE, 'w')
+    f.close()
+
+    files = os.listdir('txt-maps/')
+    # files = [
+    #     'edinburgh-10000.txt',
+    #     'icfp-coauthors-pj.txt',
+    #     'vancouver.txt',
+    #     'oxford-10000.txt',
+    # ]
+    for f in reversed(files):
+        print('')
+        map_tags = get_map_tags(f)
+        print('{} -> {}'.format(f, map_tags))
+        for name in sorted(RUN_SCRIPTS.keys()):
+            tags = run_benchmark(name, f)
+            tags.update(map_tags)
+            write_to_file(tags)
+
+
+all_benchmarks()
+# run_benchmark('kotlin_jit', 'gothenburg-sparse.txt')

bench.py

@@ -0,0 +1,5 @@
+#!/bin/bash -x
+
+./cpp/compile.sh
+./kotlin/compile.sh
+./cython/compile.sh

compile_all.sh

@@ -0,0 +1,33 @@
+
+import json
+import os
+
+
+def proces_file(file_name):
+    f = open('maps/{}'.format(file_name))
+    g = open('txt-maps/{}'.format(file_name.replace(".json", ".txt")), 'wt')
+
+    data = json.load(f)
+
+    max_city = 0
+    for city in data['sites']:
+        max_city = max(max_city, city['id'])
+
+    # g.write('{}\n'.format(len(data['sites'])))
+    g.write('{}\n'.format(max_city + 1))
+
+    mines = data['mines']
+    g.write('{}\n'.format(len(mines)))
+    g.write('{}\n'.format(' '.join(map(str, mines))))
+    g.write('{}\n'.format(len(data['rivers'])))
+    for river in data['rivers']:
+        s = river['source']
+        t = river['target']
+        g.write('{} {}\n'.format(s, t))
+    g.close()
+
+
+files = os.listdir('maps/')
+for f in files:
+    proces_file(f)
+    # break

convert.py

@@ -0,0 +1,5 @@
+#!/bin/bash
+ROOT=$(dirname ${BASH_SOURCE[0]})
+
+mkdir -p ${ROOT}/../build
+g++ -std=c++14 -O3 ${ROOT}/solver.cpp -o ${ROOT}/../build/cpp_solver.out

copy-results.txt

@@ -0,0 +1,3 @@
+#!/bin/bash
+
+./build/cpp_solver.out $1

cpp/compile.sh

@@ -0,0 +1,135 @@
+#include <stdio.h>
+#include <iostream>
+#include <vector>
+#include <string>
+#include <math.h>
+#include <algorithm>
+#include <bitset>
+#include <set>
+#include <sstream>
+#include <stdlib.h>
+#include <map>
+#include <queue>
+#include <assert.h>
+#include <deque>
+#include <string.h>
+#include <unordered_map>
+
+#include <ctime>
+
+using namespace std;
+
+#define sz(x) ((int)x.size())
+#define all(x) (x).begin(), (x).end()
+#define pb(x) push_back(x)
+#define mp(x, y) make_pair(x, y)
+
+typedef long long int64;
+
+typedef vector <int> vi;
+typedef vector <vi> vvi;
+
+
+typedef vector <string> vs;
+
+
+constexpr int NOT_PROCESSED = -1;
+
+struct Solver {
+  vvi graph;
+  vs mines;
+  int num_cities;
+
+  void init() {
+    cin >> num_cities;
+    graph.resize(num_cities);
+
+    int num_mines;
+    cin >> num_mines;
+    for (int i = 0; i < num_mines; ++i) {
+      string m;
+      cin >> m;
+      mines.push_back(m);
+    }
+
+    int n_edges;
+    cin >> n_edges;
+    for (int i = 0; i < n_edges; ++i) {
+      int s;
+      int t;
+      cin >> s >> t;
+
+      graph[s].push_back(t);
+      graph[t].push_back(s);
+    }
+  }
+
+  void compute_hash() {
+    clock_t tbegin = clock();
+
+    vvi distances(num_cities);
+    for (int i = 0; i < num_cities; ++i) {
+      vi scores;
+      run_bfs(i, scores);
+      distances[i] = std::move(scores);
+    }
+
+    int total_score = 0;
+    for (int i = 0; i < num_cities; ++i) {
+      int current_score = 0;
+      for (const auto& d : distances[i]) {
+        if (d == NOT_PROCESSED) {
+          continue;
+        }
+        int d2 = d * d;
+        current_score ^= d2;
+      }
+      total_score += current_score;
+    }
+    cout << "graph_hash=" << total_score << endl;
+
+    clock_t tend = clock();
+    double elapsed_msecs = double(tend - tbegin) / CLOCKS_PER_SEC * 1000;
+    cout << "time=" << elapsed_msecs << endl;
+    // cout << "name=cpp" << endl;
+
+  }
+
+  void run_bfs(int start, vi& scores) {
+    scores.assign(num_cities, NOT_PROCESSED);
+    scores[start] = 0;
+
+    deque<int> queue;
+    queue.push_back(start);
+
+    while (!queue.empty()) {
+      int now = queue.front();
+      queue.pop_front();
+      int value = scores[now];
+
+      for (const auto& next : graph[now]) {
+        if (scores[next] == NOT_PROCESSED) {
+          scores[next] = value + 1;
+          queue.push_back(next);
+        }
+      }
+    }
+  }
+};
+
+
+
+int main (int argc, char *argv[]) {
+  if (argc < 2) {
+    cout << "map name not specified" << endl;
+    return 1;
+  }
+	freopen(argv[1], "rt", stdin);
+	//freopen("", "wt", stdout);
+	//std::ios::sync_with_stdio(false);
+  Solver s;
+  s.init();
+  s.compute_hash();
+
+  return 0;
+}

cpp/run.sh

@@ -0,0 +1,5 @@
+#!/bin/bash
+ROOT=$(dirname ${BASH_SOURCE[0]})
+pushd ${ROOT}
+python setup.py build_ext --inplace
+popd

cpp/solver.cpp

@@ -0,0 +1,63 @@
+#include "cpp_solver.h"
+
+const int NOT_PROCESSED = -1;
+
+
+CppSolver::CppSolver(vvi* _graph)
+  : graph(_graph)
+{
+
+}
+
+void CppSolver::run_bfs(int start, vi* _scores) {
+  vi& scores = *_scores;
+  auto num_cities = graph->size();
+  scores.assign(num_cities, NOT_PROCESSED);
+  scores[start] = 0;
+
+  deque<int> queue;
+  queue.push_back(start);
+
+  while (!queue.empty()) {
+    int now = queue.front();
+    queue.pop_front();
+    int value = scores[now];
+
+    for (const auto& next : (*graph)[now]) {
+      if (scores[next] == NOT_PROCESSED) {
+        scores[next] = value + 1;
+        queue.push_back(next);
+      }
+    }
+  }
+}
+
+void CppSolver::compute_hash() {
+  clock_t tbegin = clock();
+
+  auto num_cities = graph->size();
+  vvi distances(num_cities);
+  for (int i = 0; i < num_cities; ++i) {
+    vi scores;
+    run_bfs(i, &scores);
+    distances[i] = std::move(scores);
+  }
+
+  int total_score = 0;
+  for (int i = 0; i < num_cities; ++i) {
+    int current_score = 0;
+    for (const auto& d : distances[i]) {
+      if (d == NOT_PROCESSED) {
+        continue;
+      }
+      int d2 = d * d;
+      current_score ^= d2;
+    }
+    total_score += current_score;
+  }
+  cout << "graph_hash=" << total_score << endl;
+
+  clock_t tend = clock();
+  double elapsed_msecs = double(tend - tbegin) / CLOCKS_PER_SEC * 1000;
+  cout << "time=" << elapsed_msecs << endl;
+}

cython/compile.sh

@@ -0,0 +1,36 @@
+#pragma once
+
+#include <stdio.h>
+#include <iostream>
+#include <vector>
+#include <string>
+#include <math.h>
+#include <algorithm>
+#include <bitset>
+#include <set>
+#include <sstream>
+#include <stdlib.h>
+#include <map>
+#include <queue>
+#include <assert.h>
+#include <deque>
+#include <string.h>
+#include <unordered_map>
+
+#include <ctime>
+
+using namespace std;
+
+typedef vector <int> vi;
+typedef vector <vi> vvi;
+typedef vector <string> vs;
+
+
+struct CppSolver {
+  CppSolver(vvi* _graph);
+
+  void run_bfs(int start, vi* scores);
+  void compute_hash();
+private:
+  vvi* graph;
+};