Finding permutations in strings
In C++ the Standard Template Library provides us with std::next_permutation to easily implement this.
Month: October 2015
Using OpenCV to find and draw contours in video
This is a very similar post to that posted previously, which used a OpenCV and cvBlobsLib to identify contours in video footage and display them on the screen. Please refer …
Configuring NetBeans to use OpenCV in Linux Environments
A quick guide to setting up and installing OpenCV for using in the Netbeans integrated development environment in Linux. Step 1: Download and extract OpenCV for LinuxVersions of OpenCV can …
Graph Traversals in C++ and C#
Breadth First SearchFrom WikiPedia:“Breadth-first search (BFS) is an algorithm for traversing or searching tree or graph data structures. It starts at the tree root (or some arbitrary node of a …
Implementation of the Simplex algorithm in Visual C++
An excellent implementation of the Simplex algorithm exists over at Google Code, written by Tommaso Urli:https://code.google.com/p/cpplex/Implemented as class library, it relies on no other dependencies other than the C++ Standard …
How to configure FLTK in NetBeans in Linux
Some instructions and screenshots to help you get up and running using the Fast Light Toolkit (FLTK) within the NetBeans development environment in Linux. For configuring FLTK in Visual Studio …
Fixing compiler problems when using smart pointers in NetBeans
I like using NetBeans for C++ development within Linux environments.Sometimes a gotcha can occur when trying to use the following declaration: You may wish use this in order to utilize …
Determining if paths are Hamiltonian in C++
A Hamiltonian path in a graph is a path whereby each node is visited exactly once.A number of graph-related problems require determining if the interconnections between its edges and vertices …