Java Collections: The Basics
One long section of code outlining how to use the Java Collections. As per the Java Strings post, this consists of one long code snippet outlining commonly used Java collections …
Author: Andy
Java Strings: The Basics
One long section of code outlining how to achieve some basic string handling objectives in Java. Currently trying to get to grips with this language after spending far too many …
Getting Started with Java in NetBeans
1. Create a new projectIn the File menu, select New Project:
Getting Started with Java in Eclipse
1. Open Eclipse and create a new projectSelect File -> New -> Java Project. Give your project a name and change the default locxation of the folder location, if desired. …
Implementing Dijkstra’s Algorithm using Sedgewick’s C++ Code
IntroductionDijkstra’s algorithm solves the shortest path problem for a graph with nonnegative edge weights, producing a shortest path tree. This algorithm is often used in routing and as a subroutine …
Priority Queues and Min Priority Queues in STL / C++
Programming Tip: Now you can load your essential programming tools such as emulators and IDE`s into the cloud with high performance citrix vdi from CloudDesktopOnline and access it remotely at …
Static Classes and Static Class Members in C#
Static classes – what are they?In C#, static classes have one important difference to that of non-static classes: they cannot be instantiated. That is, the new operator cannot be used …
How to Permanently Remove Items in STL Containers
remove – What is does and does not doLike all STL algorithms, remove receives a pair of iterators to identify the range of container elements over which it needs to …
Tracking Colored Objects in Video using OpenCV and cvBlobsLib
As a newcomer to image processing, I have attempted to achieve the tracking of coloured objects in some sample video footage. In my case, my little one’s blue gloves moving …
A Simple Binary Tree Implementation in C++
A very basic binary tree implementation in C++ that defines a binary tree node, adds new nodes and prints the tree.Output: