C++ Patricia Trie

A Patricia Trie also known as Practical Algorithm To Retrieve Information Coded In alphanumeric, Morrison 1968. Is a different representation for the regular trie, it is more efficient and takes less place. However the implementation is a little bit harder. Below you can find a complete impl..

Multiple languages for your Java application

This tutorial will learn you how to internationalize (support multiple languages) your Java application by using resource bundles. Btw in this tutorial I will use Netbeans. Resource bundles contain locale-specific objects. When your program needs a locale-specific resource, a String for exam..

Wake On Lan (WOL)

Waking up your computer from another PC, isn’t that cool? How does it work? In this tutorial I used MAC OSX for my client (The evil mommy who wakes up her child) and an Ubuntu Server (the child). Wake-on-LAN is implemented using a special network message called a magic packet. The magic pa..

How to Recover a WordPress Password without resetting

The first thing you need to do is go to your PhpMyAdmin and open your Users table. When we click on the tab “BROWSE” we will see all the users that are registered on your WordPress website. You will see the username and the encrypted password. Next search the users username which passwor..

C++ Splay Tree

A Splay tree is a binary SEARCH tree which reorganises himself by every (creation, deletion or location) operation. These reorganisations can all be bad, but it’s sure that every reorganisation will bring the selected node to root. These reorganisations are called “splaying”. Wikipedia..

C++ Shortest Path DAG (Directed Acyclic Graph)

In mathematics and computer science, a directed acyclic graph (DAG i/ˈdæɡ/), is a directed graph with no directed cycles. That is, it is formed by a collection of vertices and directed edges, each edge connecting one vertex to another, such that there is no way to start at some vertex v a..