Category: Source code

Dijkstra’s Algorithm implementation in Java

The Breadth First Search (BFS) algorithm basically checks only if there is a path from node A to node B. It’ doesn’t necessarily find the shortest path between two graph nodes. Here comes Dijkstra into the game. Dijkstra’s algorithm finds the shortest possible route between two graph nodes. The main difference between Dijkstra and BFS ...

PHP MySql Radius Search WebService – Source

Sometimes you need your mysql radius-search backend fast! This is how I do it on the fly. For more infos regarding radius search check this link. Enjoy the source and have fun…

Anonymous Web Scraping with Python Selenium PhantomJS Xpath and TOR

Using pure selenium methods to extract data from metasearch websites is quite tricky and uses a lot of CPU resources. I have spent significant amount of time with selenium built-in methods with python and have a feeling that the development is quite tedious, time consuming and prone to bugs. Selenium’s WebElement objects are not flexible, ...

Advertisements
Advertisements