Skip to content

Instantly share code, notes, and snippets.

**Interesting/widely used implementations of pathfinding algorithms.
==========================================================================
A* Ruby https://github.com/georgian-se/shortest-path
A* (bidirectional with shortcuts) C++ https://github.com/valhalla/valhalla
A* Unity https://arongranberg.com/astar/front
NBA* JS https://github.com/anvaka/ngraph.path
NBA* Java https://github.com/coderodde/GraphSearchPal
NBA* Java https://github.com/coderodde/FunkyPathfinding
NBA* (Parallel) C++ https://github.com/janhsimon/PNBAStar
Loading
Sorry, something went wrong. Reload?
Sorry, we cannot display this file.
Sorry, this file is invalid so it cannot be displayed.
@dkourilov
dkourilov / private_fork.md
Created May 15, 2020 22:42 — forked from 0xjac/private_fork.md
Create a private fork of a public repository

The repository for the assignment is public and Github does not allow the creation of private forks for public repositories.

The correct way of creating a private frok by duplicating the repo is documented here.

For this assignment the commands are:

  1. Create a bare clone of the repository. (This is temporary and will be removed so just do it wherever.)

git clone --bare [email protected]:usi-systems/easytrace.git

@dkourilov
dkourilov / a.diff
Created November 7, 2017 01:57
or-tools time dependent dimension patch for or-tools commit e42ef1e06e3a0600fcecc074cdf69aad4760eb49
diff --git a/Makefile.docker b/Makefile.docker
new file mode 100644
index 000000000..8cb151231
--- /dev/null
+++ b/Makefile.docker
@@ -0,0 +1,14 @@
+# General commands
+
+export:
+ mkdir export

#http://geekgirl.io/concurrent-http-requests-with-python3-and-asyncio/

Concurrent HTTP Requests with Python3 and asyncio

My friend who is a data scientist had wipped up a script that made lots (over 27K) of queries to the Google Places API. The problem was that it was synchronous and thus took over 2.5hours to complete.

Given that I'm currently attending Hacker School and get to spend all day working on any coding problems that interests me, I decided to go about trying to optimise it.

I'm new to Python so had to do a bit of groundwork first to determine which course of action was best.

#include "program_base.hpp"
#include "hpds/KDouble.hpp"
#include "hash.hpp"
#include "mmap/mmap.hpp"
#include "hpds/pstring.hpp"
#include "hpds/pstringops.hpp"
#define ELEM_SEPARATOR "\n\t\t\t"
namespace dbtoaster {
@dkourilov
dkourilov / gist:6580a9e1a1d443f1925f39953066b266
Created April 13, 2016 15:56
dbtoaster gcc 5.5 10M aggregate
denis-dev-01 ~/ny_taxi $ ll
total 305M
drwxrwxr-x 2 denis 4.0K Apr 13 15:50 .
drwxr-xr-x 7 denis 4.0K Apr 13 15:50 ..
-rw-rw-r-- 1 denis 1.1K Apr 13 15:41 main.inc.cpp
-rw-rw-r-- 1 denis 318 Apr 13 15:39 Makefile
-rwxrwxr-x 1 denis 343K Apr 13 15:50 test
-rw-rw-r-- 1 denis 12K Apr 13 15:50 test.cpp
-rw-rw-r-- 1 denis 305M Apr 13 14:22 test.csv
-rw-rw-r-- 1 denis 179 Apr 13 14:21 test.py