Hacker

A Beginner's Guide to BFS and DFS in JavaScript

Breadth-First Search (BFS) and Depth-First Search (DFS) are two fundamental algorithms used in computer science and data analysis to traverse and search data structures like graphs and trees. These ...
GitHub

Efficient Binary heap (priority queue, binary tree) data structure for JavaScript / TypeScript.

Now with support for async comparators with the new HeapAsync class! Includes JavaScript methods, Python's heapq module methods, and Java's PriorityQueue methods. Easy to use, known interfaces, tested ...
GitHub

JavaScript/WebGL lightweight and robust face tracking library designed for augmented reality face filters

This JavaScript library detects and tracks the face in real time from the camera video feed captured with WebRTC. Then it is possible to overlay 3D content for augmented reality applications. We ...
The Business Journals

How Popup Think Tank turned brainstorming into a startup

Today's top story is all about Tim Schuster and Popup Think Tank, which brings dozens of people together to supercharge the ideas of one startup founder. Let's kick a Beat! The Big One A breakdown of ...