Depth-first Search & Topological Sort in JavaScript
Breadth-first search is a great elementary algorithm for searching graphs. In lots of scenarios, BFS will be sufficient to visit all of the vertices in a... »
An implementation of Breadth-First Search in JavaScript
In the last article we introduced the next section in our series: graphs. Graphs are super important because essentially every major problem involved on the web... »
Data structures for graphs in JavaScript
Now that we’re done with searching and sorting on basic data structures, it’s time to dive into the most applicable data structure in all of computers:... »
Verifying request signatures in Elixir/Phoenix
If you’re working with public APIs a common security task is to verify request signatures to prove the request is coming from who you believe you... »
The algorithms behind the Sort function in JavaScript
Have you ever wondered what happens when you call Array.prototype.sort()? What did the creators of JavaScript use to sort items in the language? Today we’re going... »