Elizabeths-Phaeton is a min-distance problem where it requires to find K nearest points to a specific location. Inorder to do so, we implement an augmented min-heap which uses map to minimize the deleting process.
This algorithm runs on O(log(n)).
triangolatte 2D triangulation library. Allows translating lines and polygons (both based on points) to the language of GPUs. Features normal and miter
ptree This package provides an in-memory data structure for storing points. Under the hood it stores points in a tree structure where nodes are spatia
Pigo is a pure Go face detection, pupil/eyes localization and facial landmark points detection library based on Pixel Intensity Comparison-based Objec
network A VPC written in golang. Assign internal IP addresses to servers where all traffic sent internally is encrypted. OS Building Linux go build .
A Golang program for a colleague to help in calculating the ratio between the points obtained in a test and the corresponding evaluation in tenths. If you have not the compiled file (.exe) you can build it with the Go compiler.
Touch Simulation Touch Simulation is program made in Golang to simulate Touch Input in android devices using Virtual Display with UInput interface of
sig-716i A CLI tool written in Go that can be used to disrupt wireless connectivity in the area accessible to your wireless interface. This tool scans
gofind A file find utility modeled after the unix find written in Go. Why This p
Overview This cf cli plugin allows users to search for application names that co
proto-find proto-find is a tool for researchers that lets you find client side prototype pollution vulnerability. How it works proto-find open URL in
Go-edlib : Edit distance and string comparison library Golang string comparison and edit distance algorithms library featuring : Levenshtein, LCS, Ham
A Go package for calculating the Levenshtein distance between two strings This package implements distance and similarity metrics for strings, based o
levenshtein Go package to calculate the Levenshtein Distance The library is fully capable of working with non-ascii strings. But the strings are not n
Go-edlib : Edit distance and string comparison library Golang string comparison and edit distance algorithms library featuring : Levenshtein, LCS, Ham
levenshtein An implementation of the Levenshtein distance for Golang Sources Levenshtein distance Golang Install go get github.com/gitchander/levensht
npchat-helmsman Simple load-balancer for npchat servers, based on the xor distance metric between node & user id. Local Development Clone this reposit
go-haversine Heavily inspired by Umahmood's haversine, go-haversine provides a nice Go interface to calculate distance between coordinates using the h
Region quadtrees in Go Region quadtrees and efficient neighbour finding techniques in Go Go-rquad proposes various implementations of region quadtrees
go-sunrise Go package for calculating the sunrise and sunset times for a given location based on this method. Usage To calculate sunrise and sunset ti
Algorithms In this repository, some algorithms are implemented in go language. GoDoc link: ed maxflow About Max-flow problem: A flow network is repres
RoutePlanner Backend This repository contains code that powers the routeplanner app. The app suggests circular walks or runs based on start location a
this is a golang service to check user location using their IP address. The purp
Red Team TL;DR English | 中文简体 What is Red Team TL;DR ? red-tldr is a lightweight text search tool, which is used to help red team staff quickly find t
Geo Index Geo Index library Overview Splits the earth surface in a grid. At each cell we can store data, such as list of points, count of points, etc.
radix implements a radix tree. The package only provides a single Tree implementation, optimized for sparse nodes.
Zinc Zinc is a search engine that does full text indexing. It is a lightweight alternative to elasticsearch and runs in less than 100 MB of RAM. It us
Zinc Search Engine Zinc is a search engine that does full text indexing. It is a lightweight alternative to Elasticsearch and runs using a fraction of
Count-Min-Log Count-Min-Log sketch: Approximately counting with approximate counters - Guillaume Pitel & Geoffroy Fouquier TL;DR: Count-Min-Log Sketch
如何快速从深层嵌套 JSON 中找到特定的 Key #公众号 在爬虫开发的过程中，我们经常遇到一些 Ajax 加载的接口会返回 JSON 数据。
